10299
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13736
- Proper Divisor Sum (Aliquot Sum)
- 3437
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6864
- Möbius Function
- 1
- Radical
- 10299
- Omega Function (Ω)
- 2
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 60
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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 n-stacks with strictly receding walls, or the number of Type A partitions of n in the sense of Auluck (1951).at n=37A001522
- Shifts one place left under 2nd-order binomial transform.at n=7A004211
- Least k>1 such that reverse complement of first n terms of Kolakoski sequence (A000002) repeats beginning at k-th term.at n=49A025504
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 33.at n=36A031531
- Number of partitions of n with equal number of parts congruent to each of 0 and 1 (mod 4).at n=47A035540
- Number of partitions of n into parts not of the form 19k, 19k+8 or 19k-8. Also number of partitions with at most 7 parts of size 1 and differences between parts at distance 8 are greater than 1.at n=34A035977
- Composite numbers whose prime factors contain no digits other than 3 and 4.at n=18A036314
- Triangle, generated from A111579.at n=47A111673
- Number of n X n binary arrays symmetric under horizontal reflection with all ones connected only in a 1100-1000-1111 pattern in any orientation.at n=10A146683
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, -1), (-1, 1, 1), (0, 1, 0), (1, -1, 0)}.at n=10A148184
- Exponential Riordan array [exp(sinh(x)*exp(x)), sinh(x)*exp(x)].at n=28A154602
- 1+5*n+7*n^2.at n=37A168235
- Let S be the set of positive integers that, when written in binary, exist as substrings in the binary representation of n. a(n) = number of partitions of n into parts that are all members of S. Each part may occur any number of times in a partition.at n=43A175359
- a(n) = (4*n^3-3*n^2+5*n-3)/3.at n=19A177342
- Positive integers of the form (2*m^2+1)/11.at n=43A179088
- G.f. satisfies: A(x) = 1/(1 - x*A(x)^2/(1 - x^2*A(x)^2/(1 - x^3*A(x)^2/(1 - x^4*A(x)^2/(1 - ...))))), a recursive continued fraction.at n=7A192729
- Number of n X 2 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 2,2,1,1,1 for x=0,1,2,3,4.at n=13A197539
- Number of (w,x,y) with all terms in {0,...,n} and |w-x|+|x-y|+|y-w| != w+x+y.at n=21A213485
- Square array read by antidiagonals upwards: T(n,k) = Sum_{j=1..k} n^(k-j)*Stirling_2(k,j) (n >= 0, k >= 1).at n=42A241578
- Square array read by antidiagonals downwards: T(n,k) = Sum_{j=1..k} n^(k-j)*Stirling_2(k,j) (n >= 0, k >= 1).at n=38A241579