6392
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 12960
- Proper Divisor Sum (Aliquot Sum)
- 6568
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 2944
- Möbius Function
- 0
- Radical
- 1598
- 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
- 75
- 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
- If a, b in sequence, so is ab+8.at n=28A009331
- Nine iterations of Reverse and Add are needed to reach a palindrome.at n=39A015990
- Numbers which need nine 'Reverse and Add' steps to reach a palindrome.at n=38A065214
- Let r, s, t, u be four permutations of the set { 1, 2, 3, ..., n }; a(n) = minimal value of Sum_{i=1..n} r(i)*s(i)*t(i)*u(i).at n=10A070736
- G.f.: Product_{i>=1} (1 - 2*(-x)^i)/(1 - (-x)^i)^2.at n=36A104510
- Number of orbits of the 5-step recursion mod n.at n=17A106287
- Number of regions formed inside square by diagonals and the segments joining the vertices to the points dividing the sides into n equal length segments.at n=19A108914
- Number of partitions of n which represent first player winning Chomp positions with unique winning moves.at n=33A112472
- 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, 0), (0, -1, 1), (0, 0, 1), (0, 1, -1), (1, -1, 1)}.at n=9A148351
- a(n) = 100*n^2 - n.at n=7A157659
- a(n) = 400*n^2 - 2*n.at n=3A158316
- a(n) = 64*n^2 - 8.at n=9A158487
- Numbers k such that k / (A000005(k)*(A000005(k)+1)/2) is an integer.at n=28A160921
- Number of distinct solutions of sum{i=1..2}(x(2i-1)*x(2i)) = 1 (mod n), with x() only in 1..n-1.at n=41A180784
- Number of n X 5 matrices containing a permutation of 1..n*5 in increasing order rowwise, columnwise, diagonally and (downwards) antidiagonally.at n=3A181192
- T(n,k) = number of n X k matrices containing a permutation of 1..n*k in increasing order rowwise, columnwise, diagonally and (downwards) antidiagonally.at n=31A181196
- Number of 4 X n matrices containing a permutation of 1..4*n in increasing order rowwise, columnwise, diagonally and (downwards) antidiagonally.at n=4A181198
- Number of n X 4 binary arrays with every 1 having exactly one king-move neighbor equal to 1.at n=5A183437
- Number of nX6 binary arrays with every 1 having exactly one king-move neighbor equal to 1.at n=3A183439
- T(n,k)=Number of nXk binary arrays with every 1 having exactly one king-move neighbor equal to 1.at n=39A183442