8472
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 21240
- Proper Divisor Sum (Aliquot Sum)
- 12768
- 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
- 2816
- Möbius Function
- 0
- Radical
- 2118
- Omega Function (Ω)
- 5
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 34
- 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
- Maximal number of pieces obtained by slicing a torus (or a bagel) with n cuts: (n^3 + 3*n^2 + 8*n)/6 (n > 0).at n=36A003600
- From trees with valency <= 3.at n=8A006570
- 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 23.at n=32A031521
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 23.at n=3A031701
- Number of 2n-bead balanced binary necklaces which are not equivalent to their reverse, complement or reversed complement.at n=10A045675
- Convolution of A049612 with A011782.at n=8A055589
- Numbers k such that pi(k) divides k.at n=34A057809
- Consider the sequence {b(m)} of nonprimes; sequence gives values of m where gcd{m, b(m)} increases.at n=34A058011
- Diagonal of triangular spiral in A051682.at n=43A081267
- Main diagonal of A082228.at n=46A082231
- a(n) is the largest number in the set of solutions to n=x/pi(x), where pi(x)=A000720(x).at n=6A087235
- Consecutive min and max-terms of solution-clusters of A057809, i,e, least and largest solutions to n=x/A000720[x].at n=13A087241
- Number of brittle perfect graphs on n nodes.at n=7A123409
- Numbers k such that k and k^2 use only the digits 1, 2, 4, 7 and 8.at n=23A136997
- Number of n X n arrays of squares of integers summing to 14 with every element equal to at least one neighbor.at n=2A146498
- 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, 0, 1), (0, -1, 1), (0, 1, -1), (1, 1, 1)}.at n=8A149434
- 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, 1), (-1, 1, 0), (1, 0, 1), (1, 1, 0)}.at n=7A150703
- 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, 1), (1, 0, 1), (1, 1, 0)}.at n=7A150704
- Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + j*prime(j)*T(n-2, k-1) with j=3, read by rows.at n=33A153648
- Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + j*prime(j)*T(n-2, k-1) with j=3, read by rows.at n=30A153648