12985
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
- 12
- Divisor Sum
- 18468
- Proper Divisor Sum (Aliquot Sum)
- 5483
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8736
- Möbius Function
- 0
- Radical
- 1855
- Omega Function (Ω)
- 4
- 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
- 50
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = (2*n+1)*(11*n+1).at n=24A033575
- Zero, together with positive numbers k such that prime(k) - k is a square.at n=38A064370
- Rhonda numbers to base 10.at n=9A099542
- Numbers n such that prime(n) - n is a perfect power.at n=45A107607
- a(n) = (p-1)! mod p^2 where p = n-th prime.at n=35A112660
- a(n) = Sum((-1)^(n-i)*binomial(3i,i)*binomial(n+2i,3i)*2^i/(2i+1),i=0..n).at n=6A153232
- Positive numbers y such that y^2 is of the form x^2+(x+16807)^2 with integer x.at n=2A156713
- Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) - m*k*(n-k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1 and m = 1, read by rows.at n=39A157152
- Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) - m*k*(n-k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1 and m = 1, read by rows.at n=41A157152
- Integers whose binary digits "1" define, if sorted into a quadrant shape whose right angle lies in a Go board corner, same colored Go stones that surely live all, but not if any stone is omitted.at n=23A166537
- Integers n such that for all i > n the largest prime factor of product(i+k, {k,0,15}) exceeds the largest prime factor of product(n+k, {k,0,15}).at n=57A209839
- Number of triples 0 <= i, j, k < n such that bitwise AND of i, j, k is 0.at n=27A269589
- Numbers k such that k!6 + 18 is prime, where k!6 is the sextuple factorial number (A085158 ).at n=31A288445
- Start with 83; if even, divide by 2; if odd, add next three primes: Orbit of 83 under iterations of A174221, the "PrimeLatz" map.at n=23A293979
- Trajectory of 86 under repeated application of the map k -> A320486(k^2).at n=3A321011
- Trajectory of 86 under repeated application of the map k -> A320486(k^2).at n=13A321011
- Trajectory of 86 under repeated application of the map k -> A320486(k^2).at n=23A321011
- Trajectory of 86 under repeated application of the map k -> A320486(k^2).at n=33A321011
- T(n, k) = [x^k] n! [t^n] 1/(exp((V*(2 + V))/(4*t))*sqrt(1 + V)) where V = W(-2*t*x) and W denotes the Lambert function. Table read by rows, T(n, k) for 0 <= k <= n.at n=19A343805
- G.f. A(x) satisfies A(x) = 1 + x^2*(1+x)^3*A(x)^4.at n=10A366593