8040
domain: N
Properties
Digital Properties
- Digit Count
- 4
- 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
- 24480
- Proper Divisor Sum (Aliquot Sum)
- 16440
- 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
- 2112
- Möbius Function
- 0
- Radical
- 2010
- Omega Function (Ω)
- 6
- 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
- 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
- 70
- 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
- An upper bound on the biplanar crossing number of the complete graph on n nodes.at n=39A007333
- a(n) = n*(9*n-2).at n=30A013656
- Powers of fourth root of 11 rounded up.at n=15A018077
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite MFS = ZSM-57 H1.5[Al1.5Si34.5O72] starting with a T7 atom.at n=12A019174
- Number of (undirected) Hamiltonian paths in n-Moebius ladder.at n=20A020875
- a(n) = Sum_{k=0..n} T(n,k), T given by A026758.at n=12A026765
- Positive numbers having the same set of digits in base 4 and base 9.at n=41A037427
- Denominators of continued fraction convergents to sqrt(101).at n=3A041181
- Denominators of coefficients in Stirling's expansion for log(Gamma(z)).at n=33A046969
- a(n) = Sum{a(k): k=0,1,2,...,n-4,n-2,n-1}; a(n-3) is not a summand; initial terms are 0,1,4.at n=15A049860
- a(n) = Sum_{d|3} phi(d)*n^(3/d).at n=20A054602
- Numbers k such that k | sigma_11(k).at n=22A055715
- A sequence related to Ramanujan's tau function.at n=21A055978
- a(n) = Sum_{k = 1..n, gcd(k,n)=1} k*(n-k).at n=44A057789
- Numbers k such that phi(x) = k has exactly 9 solutions.at n=41A060672
- Triangle read by rows: T(n,k) is the number of simple connected graphs on n unlabeled nodes having chromatic number k, 1 <= k <= n.at n=62A084269
- Record gaps between twin primes.at n=40A113274
- Numbers k such that k and k^2 use only the digits 0, 1, 4, 6 and 8.at n=36A136861
- Expansion of phi(x) / f(-x^4)^2 in powers of x where phi(), f() are Ramanujan theta functions.at n=57A137828
- 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, 1), (-1, 0, 0), (-1, 1, 0), (0, 1, -1), (1, 0, 1)}.at n=8A149327