8480
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 20412
- Proper Divisor Sum (Aliquot Sum)
- 11932
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3328
- Möbius Function
- 0
- Radical
- 530
- Omega Function (Ω)
- 7
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 127
- 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
- Number of walks on cubic lattice.at n=31A005570
- High-temperature expansion of susceptibility mu_2 for 4-d cubic lattice.at n=3A010044
- a(n) = floor( n*(n-1)*(n-2)/23 ).at n=59A011905
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite MEL = ZSM-11 Nan[AlnSi96-nO192] starting with a T3 atom.at n=12A019149
- dot_product(n,n-1,...2,1)*(7,8,...,n,1,2,3,4,5,6).at n=25A026066
- Expansion of (theta_3(z)*theta_3(19z) + theta_2(z)*theta_2(19z))^4.at n=23A028644
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 45.at n=28A031543
- Numbers k such that 63*2^k+1 is prime.at n=40A032381
- Numbers k such that A102489(k) is divisible by k.at n=32A032563
- Consider the sequence {b(m)} of composite numbers (excluding 1); sequence gives values of b(m) where gcd(m, b(m)) increases.at n=26A058012
- Numbers k such that A000010(k) divides A074639(k).at n=41A074645
- a(n) = 2*a(n-1) + 2*a(n-2) for n > 1; a(0)=2, a(1)=2.at n=9A080040
- a(n) = floor((1+sqrt(3))^n).at n=9A080041
- Triangle read by rows: T(n,k) = number of configurations of k non-attacking bishops on the white squares of an n X n chessboard (for n even, 0 <= k < n).at n=23A088960
- Begin with 5, multiply each digit by 2, keeping the memory of the groupings of the preceding digits.at n=8A102260
- Row sums of correlation triangle for (1+x)^3/(1-x).at n=24A115293
- n+sigma(n)+sigma(sigma(n)) is a triangular number.at n=33A116015
- Triangle read by rows: T(n,k) is the number of Grand Dyck paths of semilength n that have k double rises above the x-axis (n >= 1, k >= 0).at n=38A118964
- Numbers n such that the numerator of BernoulliB[n] is divisible by 691.at n=30A119864
- Binomial transform of A010054 (characteristic function of triangular numbers).at n=15A143961