10899
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 18096
- Proper Divisor Sum (Aliquot Sum)
- 7197
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6192
- Möbius Function
- 0
- Radical
- 3633
- Omega Function (Ω)
- 4
- 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
- 161
- 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
- no
- Odd
- yes
Appears in sequences
- Number of paraffins C_n H_{2n-1} XYZ with n carbon atoms.at n=9A000640
- Numbers k such that k and 9*k are anagrams.at n=5A023093
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers >= 3), t = (F(2), F(3), F(4), ...).at n=13A024878
- Shifts left under transform T where Ta is (identity) DCONV a.at n=38A038046
- Numbers k such that k^18 == 1 (mod 19^3).at n=29A056089
- Schroeder pseudoprimes: Composites k that divide the k-th Schroeder number A001003(k-1).at n=20A075764
- Professor Umbugio's sequence A082176 divided by 2*7*53*139 = 103138.at n=3A082178
- Triangle read by rows giving coefficients of polynomials arising in successive differences of (n!)_{n>=0}.at n=40A094791
- Triangle read by rows: matrix product of the Stirling numbers of the first kind with the binomial coefficients.at n=40A126353
- G.f.: A(x) = 1 + x*exp( Sum_{k>=1} [A(3^k*x) - 1]^k/k ).at n=4A156908
- Number of nX6 0..4 arrays with each element equal to the number its horizontal and vertical neighbors equal to itself.at n=7A195967
- Least number having n orderless representations as p^2 + q^2 + r^2, where p, q, and r are primes.at n=11A214512
- Number of binary arrays indicating the locations of trailing edge maxima of a random length-n 0..5 array extended with zeros and convolved with 1,-2,1.at n=16A222150
- Numbers x whose digits can be permuted to produce a multiple of x.at n=12A245680
- Triangle read by rows, T(n,k) = Sum_{j=0..n} C(-j,-n)*S1(j,k), S1 the Stirling cycle numbers A132393, for n>=0 and 0<=k<=n.at n=50A269954
- Numbers k such that 10^k - 801 is prime.at n=25A271618
- Number of up steps in all bargraphs of semiperimeter n (n>=2).at n=8A273351
- a(n) = T(n, 4) with T(n, k) = Sum_{d|k} phi(d)*binomial(n - 1 + k/d, k/d).at n=21A327032
- Expansion of Product_{k>=1} B(x^k), where B(x) is the g.f. of A003106.at n=41A327691
- The number of overpartitions of n having more non-overlined parts than overlined parts.at n=22A340658