10053
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
- 6
- Divisor Sum
- 14534
- Proper Divisor Sum (Aliquot Sum)
- 4481
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6696
- Möbius Function
- 0
- Radical
- 3351
- Omega Function (Ω)
- 3
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 135
- 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
- a(0) = 1, a(n) = 19*n^2 + 2 for n>0.at n=23A010009
- Numbers k such that the continued fraction for sqrt(k) has period 82.at n=27A020421
- Number of partitions of n into parts not of the form 23k, 23k+11 or 23k-11. Also number of partitions with at most 10 parts of size 1 and differences between parts at distance 10 are greater than 1.at n=34A035999
- a(n)=floor((2+sqrt(7))^n).at n=6A080043
- Shadow of Pi.at n=46A110621
- Start with 1 and repeatedly reverse the digits and add 64 to get the next term.at n=35A118159
- Write 0, 1, ..., n in base 3 and add as if they were decimal numbers.at n=33A121718
- a(n+1) is the smallest integer > a(n) such that the concatenation of [a(n+1)-a(n)] and a(n+1) is a prime number.at n=57A173699
- Number of nX3 0..4 arrays with each element equal to the number its horizontal and vertical neighbors equal to 2.at n=17A197056
- Numbers with exactly 12 nonprime substrings (substrings with leading zeros are considered to be nonprime).at n=1A213319
- Number of truth tables of bracketed formulas (case 3).at n=8A218045
- Number of partitions of n such that the number of even parts is a part.at n=37A240573
- Consider a number n with m decimal digits. The sequence lists the numbers n having the suffix of length m-1 in the middle of the decimal expansion of prime(n).at n=41A242957
- Indices of even terms in A249064.at n=35A249557
- a(n) = n*(67*n - 89)/2.at n=18A263227
- Numbers k such that (302*10^k + 13)/9 is prime.at n=16A281144
- Numbers that yield a prime when prime(k+2) is inserted after the k-th digit (or prime(1) = 2 before the 1st digit for k=0), for 0 <= k <= number of digits.at n=10A304243
- Main diagonal of A332357.at n=15A332358
- Number of rungs, k, in deficient ladders to be assembled together in that order, to make a ladder that can be climbed to some height. Details are in the Comments.at n=52A377171
- Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,0) = 0^n and T(n,k) = k * Sum_{r=0..n} binomial(n+2*r+k,r) * binomial(r,n-r)/(n+2*r+k) for k > 0.at n=42A378290