16637
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
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 16896
- Proper Divisor Sum (Aliquot Sum)
- 259
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 16380
- Möbius Function
- 1
- Radical
- 16637
- 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
- 53
- 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
- a(n) = (6*n+1)*(6*n+5).at n=21A001513
- Products of 2 successive primes.at n=30A006094
- Numbers n such that n and prime(n) end with the same three digits.at n=12A067841
- a(n) = (4*n+3)*(4*n+7).at n=31A085027
- a(n) = prime(2*n-1)*prime(2*n).at n=15A089581
- Product of primes in the range [T(n-1) + 1, T(n - 1) + n], where T(n) is the n-th triangular number.at n=15A093457
- Numbers that are products of (at least two) consecutive primes.at n=43A097889
- Integer part of n#/(p-5)#, where p=preceding prime to n.at n=29A102791
- Integer part of n#/(p-7)#, where p=preceding prime to n.at n=28A102792
- Numbers k which divide the sum of the Fibonacci numbers F(1) through F(k) and such that k is not a multiple of 24.at n=19A124456
- Second trisection of A061037.at n=42A142599
- Numbers having exactly two distinct prime factors p, q with q = p+4.at n=35A143203
- Product of the n-th cousin prime pair.at n=11A143206
- Number of binary words of length n containing at least one subword 10^{7}1 and no subwords 10^{i}1 with i<7.at n=47A143287
- Number of walks within N^2 (the first quadrant of Z^2) starting and ending at (0,0) and consisting of n steps taken from {(-1, -1), (-1, 0), (0, 1), (1, 0)}.at n=12A151352
- Numbers k such that exactly one d, 2 <= d <= k/2, exists which divides binomial(k-d-1, d-1) and is not coprime to k.at n=20A178071
- Upper s-Wythoff sequence, where s=A081276 (eighth cubes). Complement of A184431.at n=49A184432
- a(n) = A050376(n)*A050376(n+1) where A050376(n) is the n-th number of the form p^(2^k) with p is prime and k >= 0.at n=37A240521
- a(n) = prime(n)^2 - 4*prime(n).at n=29A245034
- Row products of table A244365.at n=29A245722