10832
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
- 10
- Divisor Sum
- 21018
- Proper Divisor Sum (Aliquot Sum)
- 10186
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5408
- Möbius Function
- 0
- Radical
- 1354
- Omega Function (Ω)
- 5
- 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
- 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
- yes
- Odd
- no
Appears in sequences
- Number of points on surface of dodecahedron: a(n) = 30*n^2 + 2 for n > 0.at n=19A005903
- The sequence M(n) in A022905.at n=28A022908
- T(2n,n-1), T given by A026692.at n=6A026694
- Expansion of (theta_3(z)*theta_3(23z)+theta_2(z)*theta_2(23z))^4.at n=29A028660
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 13.at n=7A031691
- Numbers whose set of base-15 digits is {2,3}.at n=26A032815
- McKay-Thompson series of class 40A for Monster.at n=46A058662
- Numbers n such that 4*10^n + 3*R_n + 4 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=26A102989
- Row sums of correlation triangle for (1+x)^3/(1-x).at n=27A115293
- Diagonal sums of A104730.at n=19A131298
- a(n) = 64*n^2 + 16.at n=12A157912
- a(n) = 169*n^2 + 2*n.at n=7A158220
- Triangle read by rows: T(n,k) is the number of permutations of [n] having k cycles with at most 2 alternating runs (it is assumed that the smallest element of the cycle is in the first position), 0<=k<=n.at n=37A187247
- a(n) = 172*2^n - 176.at n=6A278124
- G.f.: Product_{k>=1} (1 + x^k) / (1 - x^(k^3)).at n=39A280277
- Numbers k such that 367*2^k+1 is prime.at n=14A323008
- Number of subsets of {1..n} containing n such that only one set can be obtained by choosing a different prime factor of each element.at n=24A370588
- Consecutive states of the linear congruential pseudo-random number generator (1541*s + 2957) mod 14000 when started at s=1.at n=3A385336