10852
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 18998
- Proper Divisor Sum (Aliquot Sum)
- 8146
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5424
- Möbius Function
- 0
- Radical
- 5426
- 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
- yes
- 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
- yes
- Odd
- no
Appears in sequences
- Expansion of 1/((1-4x)(1-8x)(1-9x)(1-11x)).at n=3A028156
- G.f.: Sum_{n >= 1} x^n/(1-x^n)^5.at n=20A073570
- Numbers k such that (2^127-1)*2^k + 1 is prime.at n=12A098126
- If mod[n,4]=0 then a(n)=a(n-1), if mod[n,4]=1 then a(n)=a(n-2)+a(n-3), if mod[n,4]=2 then a(n)=a(n-3)+a(n-4)+a(n-5), if mod[n,4]=2 then a(n)=a(n-4)+a(n-5)+a(n-6)+a[n-7].at n=35A104205
- If mod[n,4]=0 then a(n)=a(n-1), if mod[n,4]=1 then a(n)=a(n-2)+a(n-3), if mod[n,4]=2 then a(n)=a(n-3)+a(n-4)+a(n-5), if mod[n,4]=2 then a(n)=a(n-4)+a(n-5)+a(n-6)+a[n-7].at n=36A104205
- Floor of expansion (1+Pi*x)^e.at n=17A109271
- 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, -1), (-1, -1, 0), (0, 1, 0), (1, 0, 1)}.at n=9A149837
- Total number of parts that are the smallest part or the largest part in all partitions of n.at n=24A182978
- Numbers k such that there are 2 primes between 100*k and 100*k + 99.at n=32A186394
- Sum of the denominators of the Farey series of order n (A006843).at n=37A240877
- Lengths of runs of identical terms in A253415.at n=31A253425
- a(n) = the smallest number k such that the base-10 digital sum of sigma(k) is n.at n=34A256635
- Number of (n+2)X(4+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 or 00000101.at n=17A259768
- a(n) = n^3/3 - 7*n/3 + 4.at n=32A270809
- Numbers missing from A001033 despite satisfying the necessary congruence conditions (see comments).at n=12A274470
- Numbers missing from A134419 despite satisfying the necessary congruence conditions (see comments).at n=28A274471
- Number of nX4 0..1 arrays with no element unequal to more than four of its king-move neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=3A281984
- T(n,k)=Number of nXk 0..1 arrays with no element unequal to more than four of its king-move neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=24A281988
- Number of 3-abelian equivalence classes of words of length n over a binary alphabet.at n=22A289657
- On a spirally numbered square grid, with labels starting at 1, this is the number of the last cell that an (n,n+1) leaper reaches before getting trapped, or -1 if it never gets trapped.at n=16A343179