10488
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 28800
- Proper Divisor Sum (Aliquot Sum)
- 18312
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3168
- Möbius Function
- 0
- Radical
- 2622
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 4
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
- 104
- 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
- Number of partitions of n with equal nonzero number of parts congruent to each of 2 and 3 (mod 4).at n=45A035551
- a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = a(3) = 1.at n=14A049932
- Triangle read by rows: a(n,m) = T[n,m,m] where T[i,j,k] is the 3-dimensional pyramid defined by T[n,m,0]=1 and T[i,j,k]=0 if j>i or k>j and T[i,j,k]=T[i-1,j,k]+T[i,j-1,k]+T[i,j,k-1].at n=26A065078
- Row sums in A083167.at n=23A083170
- Numbers that can be expressed as the difference of the squares of primes in just three distinct ways.at n=39A090782
- Graham-Pollak sequence with initial term 5.at n=22A091522
- Sum_{k=2..n} min(k,n-k)*phi(k)*(n-k).at n=24A092274
- Number of rooted n-edge one-vertex maps on the Klein bottle (dually: one-face maps).at n=4A118447
- Numbers k such that k and k^2 use only the digits 0, 1, 4, 8 and 9.at n=34A136867
- Multi-bifurcating recursion of a factorial type based on the MacMahon numbers A060187 as a triangle sequence: t(n,k) = A060187(n,m) from polynomials; f(n, m) = If[m <= Floor[n/2], f(m, 1)*f(n - m, 1)*t(n + 1, m)].at n=4A155558
- Numbers n with property that 4 n^2 are squares arising in A158470.at n=25A158517
- a(n) = 19*n*(n+1).at n=23A173309
- Fibonacci entry points: a(n) = smallest m such that prime(A075702(n)) divides Fibonacci(m).at n=3A175026
- Number of inversions in all Dyck prefixes of length n.at n=12A221058
- Number of (n+1)X(1+1) 0..2 arrays colored with the maximum plus the minimum minus the lower median of every 2X2 subblock.at n=3A237176
- Number of (n+1)X(4+1) 0..2 arrays colored with the maximum plus the minimum minus the lower median of every 2X2 subblock.at n=0A237179
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays colored with the maximum plus the minimum minus the lower median of every 2X2 subblock.at n=6A237182
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays colored with the maximum plus the minimum minus the lower median of every 2X2 subblock.at n=9A237182
- Number of Sidon subsets of {1,...,n} of size 5.at n=23A241689
- Number of (7+2) X (n+2) 0..1 arrays with every 3 X 3 subblock sum of the two sums of the diagonal and antidiagonal minus the two minimums of the central column and central row nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=8A254913