12392
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 23250
- Proper Divisor Sum (Aliquot Sum)
- 10858
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6192
- Möbius Function
- 0
- Radical
- 3098
- Omega Function (Ω)
- 4
- 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
- 125
- 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
- If a, b in sequence, so is ab+8.at n=43A009331
- a(n) = position of n^3 + (n+1)^3 + (n+2)^3 in A024975.at n=33A024980
- a(1) = 7; a(n+1) = a(n)-th composite.at n=33A025011
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 55.at n=28A031553
- Binomial transform of A000048.at n=11A054197
- Numbers k such that k^8 == 1 (mod 9^3).at n=33A056084
- a(n) = round(e^(Pi*sqrt(n))).at n=9A056580
- Maximal number of regions into which 4-space can be divided by n hyperspheres.at n=21A059173
- a(n) = round(exp(n * Pi)).at n=3A062511
- Numbers which need ten 'Reverse and Add' steps to reach a palindrome.at n=37A065215
- Absolute row sums of triangle A104967.at n=23A104968
- a(n) = ceiling(e^(n*Pi)).at n=3A121905
- Smallest term in A005244 having exactly n distinct representations A005244(i)*A005244(j)-1.at n=6A139129
- a(n) = 729*n - 1.at n=16A158395
- Row sums of A163357 and A163359.at n=24A163365
- A156977/3.at n=7A164565
- Total number of positive integers below 10^n requiring 6 positive biquadrates in their representation as sum of biquadrates.at n=4A186657
- Triangular array: the fission of ((x+2)^n) by ((x+1)^n).at n=25A193846
- Mirror of the triangle A193846.at n=23A193847
- a(n) is a refactorable number and the sum of all refactorable numbers <= a(n) is also a refactorable number.at n=21A235177