10544
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 20460
- Proper Divisor Sum (Aliquot Sum)
- 9916
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5264
- Möbius Function
- 0
- Radical
- 1318
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 2
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
- Numbers k such that k*2^m-1 are composites for all exponents m in the range 0<=m<=k.at n=28A061154
- Triangle read by rows: T(n,k) (0 <= k <= n) is the number of Delannoy paths of length n, having k return steps to the line y = x from the line y = x+1 or from the line y = x-1 (i.e., E steps from the line y = x+1 to the line y = x or N steps from the line y = x-1 to the line y = x).at n=32A110107
- Numbers whose square starts with 4 identical digits.at n=12A132391
- Numbers equal to the Euler totient function of their arithmetic derivative: k = phi(k').at n=42A217715
- Number of (n+1)X(n+1) 0..3 arrays with every 2X2 subblock having the sum of the absolute values of the edge differences equal to 6.at n=1A233627
- Number of (n+1)X(2+1) 0..3 arrays with every 2X2 subblock having the sum of the absolute values of the edge differences equal to 6.at n=1A233629
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock having the sum of the absolute values of the edge differences equal to 6.at n=4A233635
- Number of primes <= R_n where R_n is 11...111 with n 1's.at n=5A234317
- Number of (n+2) X (2+2) 0..1 arrays with every 2 X 2 and 3X3 subblock diagonal maximum minus antidiagonal minimum nondecreasing horizontally and vertically.at n=12A253504
- Numbers k such that 7*R_(k+2) - 6*10^k is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=19A257027
- Number of 3Xn arrays containing n copies of 0..3-1 with no element 1 greater than its west, northeast or southeast neighbor modulo 3 and the upper left element equal to 0.at n=11A267223
- Expansion of Product_{k>=1} ((1 + x^k)/(1 - x^k))^(sigma(k)).at n=10A301555
- Total number of parts in all partitions of n into powers of 2: p1 <= p2 <= ... <= p_k such that p_i <= 1 + Sum_{j=1..i-1} p_j.at n=46A343944
- Numbers whose square starts with exactly 4 identical digits.at n=11A346940
- Irregular triangle read by rows: T(n, k) is the number of chains of subspaces 0 < V_1 < ... < V_r = (F_2)^n, counted up to coordinate permutation, with dimension increments given by (any fixed permutation of) the parts of the k-th partition of n in Abramowitz-Stegun order.at n=57A348113
- Largest cost for a permutation problem.at n=31A367185
- The private keys for the 32 BTC Bitcoin puzzle.at n=13A369920