10642
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 16956
- Proper Divisor Sum (Aliquot Sum)
- 6314
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4992
- Möbius Function
- -1
- Radical
- 10642
- Omega Function (Ω)
- 3
- 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
- 55
- 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
- sigma_4(n): sum of 4th powers of divisors of n.at n=9A001159
- a(n) = floor( n*(n-1)*(n-2)/8 ).at n=45A011890
- Sum of n-th powers of divisors of 10.at n=4A034517
- Sum of fourth powers of unitary divisors.at n=9A034678
- Dirichlet inverse of sigma_4 function (A001159).at n=9A053826
- a(n) = n^4*Product_{distinct primes p dividing n} (1+1/p^4).at n=9A065960
- Triangular array, read by rows: T(n,k) = Sum_{d|n} d^k, 0 <= k < n.at n=49A082771
- Floor of area of triangle with consecutive prime sides.at n=35A096377
- Backward iterated ( limited ) Fibonacci approximation: A000045.at n=17A116557
- Sum of parts, counted without multiplicities, in all partitions of n into odd parts.at n=33A116930
- Row sums of (A008550 formatted as a triangular array).at n=9A132745
- Numbers which converge to 2592 under repeated application of the powertrain map of A133500.at n=7A135384
- 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), (0, 1, 0), (1, 1, -1), (1, 1, 1)}.at n=7A150641
- Numbers k such that there are 9 digits in k^2 and for each factor f of 9 (1,3) the sum of digit groupings of size f is a square.at n=27A153747
- Numbers n such that sqrt(36*n+49) is prime.at n=37A168669
- Number of (n+1) X 4 binary arrays with every 2 X 2 subblock commuting with each of its horizontal and vertical 2 X 2 subblock neighbors.at n=13A186456
- Coefficients of a generalized Jaco-Lucas polynomial (odd indices) read by rows.at n=41A200073
- Number of binary strings of length n avoiding "squares" (that is, repeated blocks of the form xx) with |x| > 3.at n=14A230177
- Number of partitions of 2n into exactly 5 parts.at n=36A256309
- Number of partitions of 3n into exactly 5 parts.at n=24A256314