16907
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 19440
- Proper Divisor Sum (Aliquot Sum)
- 2533
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14560
- Möbius Function
- -1
- Radical
- 16907
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 58
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- a(n) = (1/2)*A050871 (row sums of array T in A050870, periodic binary words).at n=15A050872
- McKay-Thompson series of class 28A for Monster.at n=33A058606
- (P(p)-1)/2/p^2 where p runs through the odd primes different from 5 and P(k) is the k-th central pentanomial coefficient (A005191).at n=2A087189
- Output of the linear congruential pseudo-random number generator rand() used in Microsoft's Visual C++.at n=35A096558
- Numbers n such that n+2*prime(n) is a perfect square.at n=40A104776
- Number of compositions (ordered partitions) of n where the gcd of the part sizes is not 1.at n=29A178472
- a(n) is the least k such that A261865(k) = A005117(n).at n=34A262036
- The number of phi-partitions of n.at n=57A283528
- Number of compositions of n where any two parts have a common divisor > 1.at n=30A337667
- a(n) = Sum_{d|n} d^(n-d) * binomial(d+n/d-2, d-1).at n=9A339481