12810
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 35712
- Proper Divisor Sum (Aliquot Sum)
- 22902
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2880
- Möbius Function
- -1
- Radical
- 12810
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 5
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
- 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
- yes
- Odd
- no
Appears in sequences
- Sum of digits of n-th term in Look and Say sequence A005150.at n=31A004977
- Fibonacci sequence beginning 0, 21.at n=15A022355
- Expansion of 1/((1-5x)(1-8x)(1-10x)(1-11x)).at n=3A028193
- Triangle read by rows: matrix 5th power of the Stirling-1 triangle A008275.at n=42A039817
- Products of exactly 5 distinct primes.at n=35A046387
- a(n) = Sum_{k=1..n} d(k)*prime(k), where d(k) = A001223.at n=36A064009
- Integers k such that omega(k) = omega(k-1) + omega(k-2) + omega(k-3), where omega(n) is the number of distinct prime factors of n.at n=7A076252
- a(n) = Sum_{m=1..n} Sum_{i=1..m} F(i)*F(i+1) where F(n)=Fibonacci numbers A000045.at n=10A080145
- Self-convolution of A086582; the first 2^n terms of this sequence gives the 2^n terms that follow the 2^n-th term of A086582.at n=42A086583
- Triangle, read by rows, of numbers T(n,k), 0 <= k <= n, given by T(n,k) = A000364(n-k)*binomial(2*n, 2*k).at n=17A086646
- Convolution of the prime numbers with phi(n).at n=32A086734
- Duplicate of A086646.at n=17A086745
- n is divisible by the sum of all divisors of n which are less than the square root of n (values of n where 1 is the only divisor less than sqrt(n) are excluded as trivial cases.).at n=45A088345
- Numbers n such that the denominator of the 2n-th Bernoulli number is divisible by n but sum_{d|n} sigma(d)/phi(d) is not an integer.at n=10A099008
- Numbers n such that n divides the denominator of 2n-th Bernoulli number.at n=32A106741
- Triangle read by rows, T(n,k) = binomial(n,k)*A000111(n-k), 0 <= k <= n.at n=59A109449
- Triangle read by rows: T(n,k) is number of Motzkin paths of length n having k UH's, where U=(1,1), H=(1,0) (0<=k<=floor(n/3)).at n=43A114576
- a(n) = lcm(A066840(n), A124440(n)).at n=40A124447
- Numbers k for which nontrivial positive magic squares of exactly 9 different orders with magic sum k exist. For a definition of nontrivial positive magic squares, see A125005.at n=20A125016
- Records for unitary abundant numbers, i.e., those integers which set a record for having a greater unitary abundance than any of their predecessors.at n=35A129499