10044
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 30
- Divisor Sum
- 27104
- Proper Divisor Sum (Aliquot Sum)
- 17060
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3240
- Möbius Function
- 0
- Radical
- 186
- Omega Function (Ω)
- 7
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 91
- 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
- a(n) = (2*n - 5)n^2.at n=18A015240
- a(n) = n^3 + (n+1)^3 + (n+2)^3 + (n+3)^3.at n=12A027603
- a(n) = (2*n - 1)*(3*n + 1).at n=41A033569
- Number of partitions in parts not of the form 11k, 11k+1 or 11k-1. Also number of partitions with no part of size 1 and differences between parts at distance 4 are greater than 1.at n=46A035944
- Image of partition numbers (A000041) under "little Hankel" transform that sends [c_0, c_1, ...] to [d_0, d_1, ...] where d_n = c_n^2 - c_{n+1}*c_{n-1}.at n=21A056222
- Sum of decimal digits of square of divisors of n equals sum of square of digits of n.at n=35A067344
- Suppose the integer m has k decimal digits; make a list of the k! strings obtained by permuting the digits in all possible ways; discard any leading zeros; count distinct squares in the list (A062892); a(n) = smallest m that yields n squares.at n=5A068805
- Numbers divisible by twice the sum of the products of each of their digits, excluding even multiples of 10.at n=24A085446
- Positive integers k such that k^20 + 1 is semiprime (A001358).at n=36A105282
- Triangle, read by rows, equal to the matrix inverse of Q=A113381.at n=21A114158
- Negative value of coefficient of x^(n-4) in the characteristic polynomial of a certain n X n integer circulant matrix.at n=2A127409
- Numbers k such that for any single digit d of k the d-th semiprime sp(k) is substring of k.at n=19A135441
- Binomial transform of [1, 3, 3, 1, 1, -1, 1, -1, 1, ...].at n=31A140226
- A090801(2n-1)+A090801(2n).at n=26A140958
- a(n) = 1 if a(n-1) is prime, otherwise a(n-1) + a(n-2), with a(0) = 0 and a(1) = 1.at n=44A142878
- Products of form p^4*q^2*r where p, q and r are three distinct primes.at n=41A179669
- a(n) is the smallest 5-digit number with exactly n divisors, or a(n) = 0 if no such number exists.at n=29A182697
- Numbers k such that both k and k^2 are sums of a twin prime pair.at n=6A213784
- T(n,k), for n,k >= 1, is the number of partitions of the set [n] into k blocks, where, if the blocks are arranged in order of their minimal element, the odd-indexed blocks are all singletons.at n=72A246118
- Triangle of allowable Stirling numbers of the second kind a(n,k).at n=60A256161