10647
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 19032
- Proper Divisor Sum (Aliquot Sum)
- 8385
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5616
- Möbius Function
- 0
- Radical
- 273
- Omega Function (Ω)
- 5
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 55
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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 that divide s(k), where s(1)=1, s(j)=9*s(j-1)+j.at n=37A014857
- a(n) = floor(floor(S3)/floor(S1)), where S3 and S1 are, respectively, the 3rd and first elementary symmetric functions of {sqrt(k), k = 1,2,...,n}.at n=50A025200
- Numbers k such that 227*2^k+1 is prime.at n=12A032490
- a(n) = 7*n^2.at n=39A033582
- Concatenations C1 and C2 and C3 are all prime (see the comment lines).at n=2A034818
- Gaps of 7 in sequence A038593 (upper terms).at n=29A038654
- Ruth-Aaron numbers (2): sum of prime divisors of n = sum of prime divisors of n+1 (both taken with multiplicity).at n=20A039752
- Number of partitions satisfying cn(1,5) + cn(4,5) < cn(2,5) + cn(3,5).at n=38A039892
- Odd composite numbers divisible by the sum of their prime factors (counted with multiplicity).at n=32A046347
- a(n) = (1/24)*n*(n + 5)*(n^2 + n + 6).at n=20A051743
- a(n) = n^3 - 1.at n=21A068601
- a(n) = number of Egyptian fractions 1 = 1/x_1 + ... + 1/x_k (for any k), 0<x_1<...<x_k<=n.at n=49A092670
- a(n) = number of Egyptian fractions 1 = 1/x_1 + ... + 1/x_k (for any k), 0<x_1<...<x_k<=n.at n=48A092670
- a(n) = number of Egyptian fractions 1 = 1/x_1 + ... + 1/x_k (for any k), 0<x_1<...<x_k<=n.at n=50A092670
- a(n) = number of Egyptian fractions 1 = 1/x_1 + ... + 1/x_k (for any k), 0<x_1<...<x_k<=n.at n=47A092670
- a(n) = round(10000*log(n/10)).at n=28A104077
- Numbers n such that n+2*prime(n) is a perfect square.at n=28A104776
- a(n) = (n+1)^2*(n+2)*(2*n+3)/6.at n=12A108678
- Numbers n such that n and its digit reversal R(n) both are difference of positive cubes.at n=17A109879
- Inverse of Riordan array (1/(1-x), x/(1-x)^4), A109960.at n=31A109962