10428
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 26880
- Proper Divisor Sum (Aliquot Sum)
- 16452
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3120
- Möbius Function
- 0
- Radical
- 5214
- Omega Function (Ω)
- 5
- 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
- 86
- 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 into parts not of the form 25k, 25k+11 or 25k-11. Also number of partitions with at most 10 parts of size 1 and differences between parts at distance 11 are greater than 1.at n=33A036010
- McKay-Thompson series of class 9c for the Monster group.at n=27A058095
- Least multiple k of prime(n) such that (k-1,k+1) forms a twin prime pair, or 0 if no such number exists.at n=21A090530
- Least positive k such that (10^n+1)^n + k is prime.at n=30A121521
- Floor of sum of the first n^2 square roots.at n=25A138357
- Numbers such that all subsets of {prime(a(1)), ..., prime(a(n))} have a different sum.at n=16A138856
- Number of reducible Boolean polynomials of degree n.at n=14A169913
- Number of ways to choose four collinear points from an n X n grid.at n=10A178256
- Half the number of (n+1) X 2 0..2 arrays with no 2 X 2 subblock having sum 4.at n=3A183784
- Half the number of (n+1)X5 0..2 arrays with no 2X2 subblock having sum 4.at n=0A183787
- T(n,k)=Half the number of (n+1)X(k+1) 0..2 arrays with no 2X2 subblock having sum 4.at n=6A183792
- T(n,k)=Half the number of (n+1)X(k+1) 0..2 arrays with no 2X2 subblock having sum 4.at n=9A183792
- A000145(n) / 8 - (n^5 + 1).at n=34A188671
- Number of ordered triples (w,x,y) with all terms in {-n,...-1,1,...,n} and 2w+x+y>1.at n=14A211618
- n-th derivative of (x^(x^x))^(x^x) at x=1.at n=6A215708
- Sixth derivative of f_n at x=1, where f_n is the n-th of all functions that are representable as x^x^...^x with m>=1 x's and parentheses inserted in all possible ways.at n=10A215836
- Number of partitions of n into distinct parts with boundary size 7.at n=36A227564
- Number of (n+1)X(7+1) 0..1 arrays with every 2X2 subblock ne-sw antidiagonal difference unequal to its neighbors horizontally and nw+se diagonal sum unequal to its neighbors vertically.at n=7A253697
- Number of (n+2) X (4+2) 0..1 arrays with no 3 x 3 subblock diagonal sum 1 and no antidiagonal sum 2 and no row sum 0 and no column sum 3.at n=36A255797
- Numbers n such that for some m, A166133(m)=n, A166133(m+1)=n^2-1, in order of increasing m.at n=21A256406