10652
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 18648
- Proper Divisor Sum (Aliquot Sum)
- 7996
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5324
- Möbius Function
- 0
- Radical
- 5326
- Omega Function (Ω)
- 3
- 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
- 86
- 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
- yes
- Odd
- no
Appears in sequences
- Number of paraffins C_n H_{2n} X Y with n carbon atoms.at n=11A000635
- Oscillates under partition transform.at n=47A007211
- Numbers k such that k^6 == 1 (mod 7^4).at n=26A056092
- Numbers k > 1 such that, in base 7, k and k^2 contain the same digits in the same proportion.at n=4A061661
- Symmetric square array, read by antidiagonals: T(k, k) = T(0, k + 1) = Sum_{m = 0..k} C(k, m)*T(m, k - m) for k >= 0; T(0, 0) = 1; T(n, k) = T(n - 1, k) + T(n, k - 1) for n, k >= 1.at n=37A085484
- Symmetric square array, read by antidiagonals: T(k, k) = T(0, k + 1) = Sum_{m = 0..k} C(k, m)*T(m, k - m) for k >= 0; T(0, 0) = 1; T(n, k) = T(n - 1, k) + T(n, k - 1) for n, k >= 1.at n=43A085484
- p such that p^4 + q^4 = r^4 + s^4 = a(n).at n=35A088728
- a(n) = floor(10^n/7^n).at n=26A094992
- a(n) = 6 + floor((1 + Sum_{j=1..n-1} a(j))/3).at n=26A120152
- Number of partitions of n into {number of partitions of n into "number of partitions of n into 'number of partitions of n into partition numbers' numbers" numbers} numbers.at n=47A130900
- Table of the numerators of the fractions of Bernoulli twin numbers and their higher-order differences, read by antidiagonals.at n=74A168516
- Array read by antidiagonals: numerators of the core of the classical Bernoulli numbers.at n=52A240581
- Nonprimes such that it takes exactly 3 iterations of reverse-and-add digits to generate a prime.at n=14A245208
- Numbers n such that n!3 - 3^3 is prime, where n!3 = n!!! is a triple factorial number (A007661).at n=24A247463
- a(n) = n^3 + 4.at n=22A274077
- Coordination sequence for "reo" 3D uniform tiling.at n=39A299279
- Number of nX6 0..1 arrays with every element unequal to 1, 2, 4, 6 or 7 king-move adjacent elements, with upper left element zero.at n=6A305095
- Number of nX7 0..1 arrays with every element unequal to 1, 2, 4, 6 or 7 king-move adjacent elements, with upper left element zero.at n=5A305096
- a(n) = numerator of Sum_{k=2..A335138(n)} abs(A309229(n, k))/k.at n=11A335416
- Number of partitions of n into an odd number of parts that are not multiples of 4.at n=44A339407