10878
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 25992
- Proper Divisor Sum (Aliquot Sum)
- 15114
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3024
- Möbius Function
- 0
- Radical
- 1554
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- yes
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- yes
- 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
- 68
- 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
- Smallest integer m such that the product of every 4 consecutive integers > m has a prime factor > prime(n).at n=11A003033
- Number of n step self-avoiding walks on 3 X infinity grid starting from (0,1).at n=12A007825
- Number of Barlow packings with group R3(bar)m(O) that repeat after 6n layers.at n=13A011955
- Pisot sequence E(10,18), a(n)=[ a(n-1)^2/a(n-2)+1/2 ].at n=12A014006
- a(n) = 2*n*(4*n - 1).at n=37A014635
- Positive numbers k such that k and 8*k are anagrams in base 9 (written in base 9).at n=4A023085
- Convolution of (F(2), F(3), F(4), ...) and odd numbers.at n=14A023652
- Numbers k such that 3^k == -1 (mod k-1).at n=13A055686
- a(n) = 25*n*(n + 1)/2 + 3.at n=29A061793
- Numbers k such that prime(k+3)-(k+3)*tau(k+3) = prime(k-3)-(k-3)*tau(k-3) where tau(k) = A000005(k) is the number of divisors of k.at n=28A067355
- Triangular numbers of the form 21*k.at n=28A069499
- Triangular numbers which are 5-almost primes.at n=28A076579
- Smallest triangular number > 1 and == 1 (mod prime(n)).at n=34A087397
- Number of configurations of the sliding block 8-puzzle that require a minimum of n moves to be reached, starting with the empty square in one of the corners.at n=19A089473
- a(n) = (n+1)(n+2)^3*(n+3)^2*(n+4)(n^2 + 4n + 5)/1440.at n=4A107967
- a(n) = (1/3)*n^3 - n^2 - (1/3)*n - 1.at n=33A109620
- Triangular numbers that are sums of two consecutive primes.at n=20A111163
- Hexagonal numbers for which the product of the digits is also a hexagonal number.at n=29A117063
- Hexagonal numbers divisible by 6.at n=25A117794
- Triangular numbers with more than three distinct prime factors.at n=41A121479