12599
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12936
- Proper Divisor Sum (Aliquot Sum)
- 337
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12264
- Möbius Function
- 1
- Radical
- 12599
- Omega Function (Ω)
- 2
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 63
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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
- Number of partitions of n with equal number of parts congruent to each of 0 and 1 (mod 3).at n=49A035534
- Numbers k such that A055079(k) = 2^k.at n=29A057838
- Numbers whose cubes contain more than half the same digit and do not end in 0.at n=30A060814
- Cube root of A061096(n).at n=31A067177
- Composite numbers k such that sigma(2*k+1)-sigma(k) = k+1.at n=3A068368
- First minimum value > 0 of the form x^3-k^2 when k > n^3.at n=22A070959
- a(n) is the largest integer whose cube has n digits and first digit 1, except that a(2)=2.at n=12A083378
- Numbers k such that either k or k+1 is divisible by the numbers from 1 to 10.at n=18A131663
- Row sums of triangle T(j,k) = (j^k) mod (j*k) for 1 <= k <= j (see A096133).at n=42A157351
- a(n) = 900*n - 1.at n=13A158409
- a(n) = 14*n^2 - 1.at n=29A158485
- a(n) = 56*n^2 - 1.at n=14A158658
- Numbers m such that m mod k is k-1 for all k = 2..9.at n=4A166931
- Smallest k such that 40^k mod k = n.at n=57A178201
- Numbers n such that sopfr(n) - (floor(sqrt(n))*bigomega(n)) = floor(sqrt(n)).at n=19A180877
- Smallest number m such that A226460(m) = n.at n=20A226462
- a(n) = round(3*(4/3)^n).at n=29A227391
- a(1) = greatest k such that H(k) - H(2) < 1/1 + 1/2; a(2) = greatest k such that H(k) - H(a(1)) < H(a(1)) - H(2); and for n>2, a(n) = greatest k such that H(k) - H(a(n-1)) < H(a(n-1)) - H(a(n-2)), where H = harmonic number.at n=5A227728
- a(n) = 7*n^2 - 7*n - 43.at n=42A298078
- Numbers k such that A361338(k) = 8.at n=47A361347