8475
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 14136
- Proper Divisor Sum (Aliquot Sum)
- 5661
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4480
- Möbius Function
- 0
- Radical
- 1695
- Omega Function (Ω)
- 4
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 109
- 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
- no
- Odd
- yes
Appears in sequences
- f-vectors for simplicial complexes of dimension at most 1 (graphs) on at most n-1 vertices.at n=37A011826
- a(1) = 1; a(n+1) = floor((sum{k=1 to n} a(k)^3)^(1/3)).at n=47A016085
- a(n) = Sum_{k=0..n-1} T(n,k) * T(n,k+1), with T given by A026670.at n=6A026982
- Second pentagonal numbers with odd index: a(n) = (2*n-1)*(3*n-1).at n=38A033568
- Number of 4-element families of an n-element set such that every 3 members of the family have a nonempty intersection.at n=5A051365
- Numbers m such that there are precisely 3 groups of order m.at n=38A055561
- a(n) = (2*n-1)*(13*n^2-13*n+6)/6.at n=12A063493
- Triangle T(n,k) defined by Sum_{1<=k<=n} T(n,k)*u^k*t^n/n! = exp(((1-t)*(1-t^2)*(1-t^3)...)^(-u)-1).at n=18A066045
- Smallest of 4 consecutive numbers each divisible by a square.at n=13A070284
- Variant of triangle A008301, read by rows of 2*n+1 terms, such that the first column is the secant numbers (A000364).at n=19A125053
- Variant of triangle A008301, read by rows of 2*n+1 terms, such that the first column is the secant numbers (A000364).at n=21A125053
- Diagonal of symmetric triangle A125053 located immediately below the central terms (A125054).at n=3A125055
- Numbers k such that 6*p(k)*p(k+1)*p(k+2)*p(k+3)*p(k+4)-1 and 6*p(k)*p(k+1)*p(k+2)*p(k+3)*p(k+4)+1 are twin primes with p(h) = h-th prime.at n=23A129310
- Integers arising in A133677.at n=16A133645
- a(n) = (4*n^3 - 6*n^2 + 8*n + 3)/3.at n=19A161712
- a(n) = (6 + 10*n + 5*n^2 + n^3)/2.at n=24A164845
- a(n) = n*(14*n - 11).at n=25A195021
- a(n) = (n-2)*(14*n-39) for n > 2, otherwise a(n) = n.at n=27A195030
- Left half of triangle A125053.at n=13A210111
- Number of 0..6 arrays of length n with each element differing from at least one neighbor by 1 or less.at n=5A221594