12834
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
- 3
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 29952
- Proper Divisor Sum (Aliquot Sum)
- 17118
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3960
- Möbius Function
- 0
- Radical
- 4278
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 63
- 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
- Numbers whose set of base-16 digits is {2,3}.at n=22A032816
- 9 times pentagonal numbers: 9*n*(3*n-1)/2.at n=31A152996
- Smallest number k such that k^n is the sum of numbers in a twin prime pair.at n=29A195336
- Number of -3..3 arrays x(i) of n+1 elements i=1..n+1 with set {t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^(t+u+v)) having two, four, six or seven distinct values for every i,j,k<=n.at n=5A211738
- Numbers n such that phi(n) = sigma(n) - reversal(sigma(n)).at n=5A230012
- a(n) = Sum_{i=0..n} digsum_4(i)^4, where digsum_4(i) = A053737(i).at n=35A231667
- a(n) = Sum_{i=0..n} digsum_6(i)^3, where digsum_6(i) = A053827(i).at n=62A231674
- Numbers k whose decimal expansion can be split into at least two parts whose binary equivalents can be concatenated (in the same order) to form the binary expansion of the original number k.at n=14A237041
- Numbers m such that k*phi(n) = Sum_{j|n} sigma(j), where k >= 1 is an integer.at n=23A243373
- Numbers whose squares remain squares when prepended with 9 and appended with 25 in base 10.at n=1A250435
- Number of (1+1) X (n+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)+x(i-1,j) in the j direction.at n=37A250756
- Number of nX5 0..1 arrays with every element equal to 0, 1, 3 or 4 king-move adjacent elements, with upper left element zero.at n=7A297904
- Expansion of 1/(1 - 9*x/(1 + x)^2)^(1/3).at n=6A361882