8492
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 16296
- Proper Divisor Sum (Aliquot Sum)
- 7804
- 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
- 3840
- Möbius Function
- 0
- Radical
- 4246
- 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
- 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
- Dodecahedral surface numbers: a(0)=0, a(1)=1, a(2)=20, thereafter 2*((3*n-7)^2 + 21).at n=24A007589
- Number of Barlow packings that repeat after exactly n layers.at n=20A011768
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (odd natural numbers), t = A000201 (lower Wythoff sequence).at n=30A024599
- Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 23 (most significant digit on right and removing all least significant zeros before concatenation).at n=7A029540
- a(n) = floor(exp(12/23) * n!).at n=6A030817
- 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 46.at n=39A031544
- a(n) = n * prime(n).at n=43A033286
- Number of rooted identity trees with n nodes and 3 leaves.at n=22A055328
- Numbers k such that 2^k - 5 is prime.at n=30A059608
- Number of ways to place 5 nonattacking queens on a 5 X n board.at n=11A061991
- Sum of next n squares.at n=7A072474
- Total number of prime power parts in all partitions of n.at n=24A073335
- Number of edge-rooted unlabeled graphs with n edges.at n=8A126133
- Triangle read by rows: T(n,k) = the number of Dyck paths of semilength n with k UUUU's.at n=41A135305
- 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, 0), (-1, 0, 1), (1, -1, 0), (1, 0, -1), (1, 1, 0)}.at n=8A149208
- Partial sums of A061262.at n=23A176661
- Numbers n for which the alternating sum of the digits of n^n is 0.at n=22A244212
- Number of length 3+1 0..n arrays with the sum of the cubes of adjacent differences multiplied by some arrangement of +-1 equal to zero.at n=42A250230
- Number of (n+2) X (4+2) 0..1 arrays with no 3 X 3 subblock diagonal sum 0 and no antidiagonal sum 3 and no row sum 0 or 3 and no column sum 0 or 3.at n=14A258962
- Number of ways to place m nonattacking queens on an m X n board, 1 <= m <= n (triangular array).at n=59A269133