10536
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
- 16
- Divisor Sum
- 26400
- Proper Divisor Sum (Aliquot Sum)
- 15864
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3504
- Möbius Function
- 0
- Radical
- 2634
- 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
- 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
- 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
- Numerators of continued fraction convergents to sqrt(509).at n=8A041972
- Numbers n such that 167*2^n-1 is prime.at n=23A050835
- Integers that can be expressed as the sum of consecutive primes in exactly 4 ways.at n=32A054999
- Number of asymmetric (identity) trees with n nodes and 4 leaves.at n=33A055335
- Numbers which are the sum of their proper divisors containing the digit 5.at n=13A059464
- Integers expressible as the sum of (at least two) consecutive primes in at least 4 ways.at n=20A067374
- A Wallis pair (x,y) satisfies sigma(x^2) = sigma(y^2); sequence gives x's for indecomposable Wallis pairs with x < y (ordered by values of x).at n=24A075768
- Largest achievable determinant of a 3 X 3 matrix whose elements are 9 distinct integers chosen from the range -n...n.at n=11A097693
- Partial sums of A151791.at n=30A151792
- Principal diagonal of the convolution array A213778.at n=30A213779
- Volume of right regular hexagonal pyramid with height and side lengths n, rounded down.at n=22A234729
- Number of partitions of n such that (number parts having multiplicity 1) is a part or (number of parts > 1) is a part.at n=35A241515
- Number of compositions of n in which each part has odd multiplicity.at n=17A242391
- Expansion of b(q^3) * b(q^12) / (b(-q) * b(q^6)) in powers of q where b() is a cubic AGM theta function.at n=12A258111
- k-digit composite numbers Sum_{j=0..k-1} d_(j)*10^j with exactly k prime factors, p_(0), p_(1), ..., p_(k-2), p_(k-1), written in ascending order, such that Sum_{j=0..k-1} d_(j)^p_(j) is a prime number.at n=38A283805
- a(0)=1; a(1)=1; for n >= 2, a(n) = a(n-A000120(n)) + a(n-1-A023416(n)).at n=34A297216
- Triangle read by rows, T(n,k) = [x^k] Sum_{k=0..n} p_{n,k}(x) where p_{n,k}(x) = x^(n-k)*binomial(n,k)*hypergeom([-k, k-n, k-n], [1, -n], 1/x), for 0 <= k <= n.at n=58A299500
- Expansion of Product_{k>=1} (1 + x^k)^A002131(k).at n=17A301798
- Triangle read by rows: T(m,n) is the label of the largest square that an (m,n)-leaper (a generalization of a chess knight) reaches before it can no longer move, starting on a board with squares spirally numbered, starting at 1; 1 <= n < m. Each move is to the lowest-numbered unvisited square.at n=23A306197
- Sum of the fourth largest parts in the partitions of n into 6 parts.at n=42A308870