10907
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11760
- Proper Divisor Sum (Aliquot Sum)
- 853
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10056
- Möbius Function
- 1
- Radical
- 10907
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 161
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that (64*10^(k-1) + 53)/9 is a depression prime.at n=0A082710
- Interpolate 0's between each pair of digits of n-th prime.at n=44A092909
- a(n) = 839*n.at n=13A135639
- Expansion of 1/(1 - x - 4*x^2 + 4*x^3 - 2*x^4).at n=12A175713
- Boustrophedon transform of Thue-Morse sequence A001285.at n=8A230958
- Numbers k such that R_(k+2) + 6*10^k is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=20A256932
- Number of n X 4 0..1 arrays with every element unequal to 0, 1, 3, 4, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=8A317262
- Integers k such that for all m>k, d(m)/m < d(k)/k where d(j) = Min_{p & q odd primes, 2*j = p+q, p <= q} (q-p)/2.at n=16A335297
- Number of ways that n can be expressed as a sum of consecutive integers from 0 up to at most n, where any of the terms in the sum can be negated, and the partial sum from 0 is always between 0 and n inclusive.at n=55A364721
- Number of integer partitions of n with a unique composite part.at n=42A379302
- Odd semiprimes k = p*q such that k = A325820(p,q), with p, q primes > 3, and A325820 is the carryless base-3 multiplication.at n=34A391331