10049
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
- 4
- Divisor Sum
- 10836
- Proper Divisor Sum (Aliquot Sum)
- 787
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9264
- Möbius Function
- 1
- Radical
- 10049
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 135
- 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
- a(n) = floor( n*(n-1)*(n-2)/11 ).at n=49A011893
- Number of squares on infinite chessboard at <= n knight's moves from a fixed square.at n=27A018836
- Numbers k such that the continued fraction for sqrt(k) has period 49.at n=13A020388
- a(n) = [ (3rd elementary symmetric function of S(n))/(first elementary symmetric function of S(n)) ], where S(n) = {first n+2 positive integers congruent to 1 mod 3}.at n=11A024220
- Number of partitions of n with equal number of parts congruent to each of 0 and 3 (mod 5).at n=41A035554
- Number of partitions satisfying cn(2,5) + cn(3,5) <= 1.at n=44A039857
- Number of self-conjugate three-quadrant Ferrers graphs that partition n.at n=49A059777
- Denominators of convergents to sqrt(e).at n=10A078737
- a(n) = 10*n^2 - 6*n + 1.at n=31A087348
- Start with 1 and repeatedly reverse the digits and add 74 to get the next term.at n=38A118225
- Form the difference table of the sequence {2^k*k!}, then divide k-th column entries by 2^k*k!. Array read by ascending antidiagonals, T(n, k) for n, k >= 0.at n=31A143410
- Partial sums of the generalized Cuban primes A007645.at n=44A172113
- Least natural number n in increasing order such that the sum of decimal digits is equal to A001223(n).at n=29A179462
- Number of partitions of n containing a clique of size 5.at n=38A183562
- Number of unlabeled rooted trees with n nodes and maximal outdegree (branching factor) 10.at n=9A244406
- Number of unlabeled rooted trees with 2n nodes and maximal outdegree (branching factor) n.at n=9A244407
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 1006", based on the 5-celled von Neumann neighborhood.at n=28A273861
- Numerator of the n-th partial sum of the reciprocals of the successive prime gaps.at n=37A274827
- Magic numbers of anti-Mackay icosahedra.at n=12A277131
- Let p = n-th prime == 7 mod 8; a(n) = sum of quadratic nonresidues mod p that are > p/2.at n=12A282042