8070
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 19440
- Proper Divisor Sum (Aliquot Sum)
- 11370
- 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
- 2144
- Möbius Function
- 1
- Radical
- 8070
- Omega Function (Ω)
- 4
- 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
- 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
- Max_{k=0..n} { Number of partitions of n into exactly k parts }.at n=45A002569
- Molien series for A_10.at n=35A008633
- Number of partitions of n into at most 10 parts.at n=35A008639
- Number of partitions of n in which the greatest part is 10.at n=45A026816
- T(2n,n-3), T given by A026780.at n=4A026893
- Number of partitions of n into parts 4k+1 or 4k+2.at n=51A035365
- Numbers whose base-6 representation has exactly 6 runs.at n=30A043614
- T(n,2), array T as in A054126.at n=9A054128
- Numbers n such that n | 12^n + 11^n + 10^n + 9^n + 8^n.at n=33A057250
- Floor( phi * (3/2)^n ) where phi = (1+sqrt(5))/2.at n=21A081226
- Numbers m such that m! + p is a prime, where p is the smallest prime > m.at n=23A084749
- Number of 3 X n (0,1) matrices such that each row and each column is nondecreasing or nonincreasing.at n=14A086113
- T(n,k) = Points in n-dimensional lattice of side length k with at least one coordinate = k and GCD of all coordinates = 1.at n=71A090225
- Value of k pertaining to A114741.at n=22A114742
- G.f. satisfies: A(x) = (1+x) * A(x^2)*A(x^3)*A(x^4)*...*A(x^n)*...at n=31A129373
- a(n) = 250*n - 180.at n=33A154360
- a(n) = 9n^2 - n.at n=29A154516
- A triangle sequence related to the Eulerian numbers of the second kind: t(n,m) = Sum_{i=0..m}(-1)^(m-i)*binomial(n-i-1, m-i)*Stirling2(n+i+1, i+1).at n=30A156363
- a(n) = 36*n^2 - 2*n.at n=14A158062
- a(n) = 900*n^2 - 30.at n=2A158669