12859
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 16128
- Proper Divisor Sum (Aliquot Sum)
- 3269
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9960
- Möbius Function
- -1
- Radical
- 12859
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 169
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Numbers k such that sigma(k) = sigma(k+6).at n=32A015866
- Denominators of continued fraction convergents to sqrt(331).at n=10A041625
- a(n) = ((n^6 - (n-1)^6) - (n^2 - (n-1)^2))/60.at n=10A079547
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, -1, 1), (-1, 0, -1), (1, 0, -1), (1, 1, 1)}.at n=8A149541
- Products of 3 distinct safe primes.at n=32A157354
- Permutation trees of power n and height k.at n=32A179454
- Number of nX3 0..2 arrays with no more than floor(nX3/2) elements equal to at least one king-move neighbor, with new values introduced in row major 0..2 order.at n=5A223469
- Number of nX6 0..2 arrays with no more than floor(nX6/2) elements equal to at least one king-move neighbor, with new values introduced in row major 0..2 order.at n=2A223472
- T(n,k)=Number of nXk 0..2 arrays with no more than floor(nXk/2) elements equal to at least one king-move neighbor, with new values introduced in row major 0..2 order.at n=30A223473
- T(n,k)=Number of nXk 0..2 arrays with no more than floor(nXk/2) elements equal to at least one king-move neighbor, with new values introduced in row major 0..2 order.at n=33A223473
- Number of (n+1) X (1+1) 0..3 arrays with no element unequal to a strict majority of its horizontal and vertical neighbors, with values 0..3 introduced in row major order.at n=12A231337
- Number of (n+1) X (3+1) 0..1 arrays with no 2 X 2 subblock having the maximum of its diagonal elements greater than the absolute difference of its antidiagonal elements.at n=4A251312
- Number of (n+1)X(5+1) 0..1 arrays with no 2X2 subblock having the maximum of its diagonal elements greater than the absolute difference of its antidiagonal elements.at n=2A251314
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with no 2X2 subblock having the maximum of its diagonal elements greater than the absolute difference of its antidiagonal elements.at n=23A251317
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with no 2X2 subblock having the maximum of its diagonal elements greater than the absolute difference of its antidiagonal elements.at n=25A251317
- Numbers n such that 13^n is the highest power of 13 dividing A240751(n).at n=9A286007
- One of the two successive approximations up to 2^n for 2-adic integer sqrt(-3/5). This is the 3 (mod 4) case.at n=12A341601