10892
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 21840
- Proper Divisor Sum (Aliquot Sum)
- 10948
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 4656
- Möbius Function
- 0
- Radical
- 5446
- 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
- 55
- 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
- Number of points on surface of cuboctahedron (or icosahedron): a(0) = 1; for n > 0, a(n) = 10n^2 + 2. Also coordination sequence for f.c.c. or A_3 or D_3 lattice.at n=33A005901
- a(n) = 1*prime(n) + 2*prime(n-1) + ... + k*prime(n+1-k), where k=floor((n+1)/2) and prime(n) is the n-th prime.at n=31A023870
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = (primes).at n=30A024867
- Number of partitions of n with equal number of parts congruent to each of 1 and 2 (mod 5).at n=47A035556
- Numerators of continued fraction convergents to sqrt(776).at n=5A042496
- Number of basis partitions of n+16 with Durfee square size 4.at n=46A053798
- Numbers k such that k^256 + 1 is prime.at n=31A056995
- Number of rooted trees of 2n+1 nodes with every leaf at height n.at n=18A074045
- Smallest number k such that there are exactly n relatively prime numbers using all digits of k.at n=38A075604
- a(n) is the smallest number m such that n^2^k + m^2^k is prime for k=0,1,2,3 and 4.at n=16A090873
- a(n) = T(p(n)) - p(T(n)) = Commutator[triangular numbers, primes] at n.at n=43A123907
- Maximum cycle size in range [A014137(n-1)..A014138(n-1)] of permutation A125977/A125978.at n=11A126318
- Number of partitions of n into "number of partitions of n into partition numbers" numbers.at n=46A130898
- Number of permutations of floor(i*7/3), i=0..n-1, with all sums of two and three adjacent terms respectively unique.at n=7A147928
- Number of permutations of floor(i*7/3), i=0..n-1, with all sums of 2 through 4 adjacent terms respectively unique.at n=7A147937
- Number of permutations of floor(i*7/3), i=0..n-1, with all sums of 2 through 5 adjacent terms respectively unique.at n=7A147946
- A triangular sequence based on the first level sum of polynomial coefficients: p(x,n,m)=(1 - x)^(n + m + 1)*Sum[k^(n - 1)*(1 - k)^(m - 1)*x^k, {k, 0, Infinity}]/4.at n=23A168217
- a(n) = n*(14*n-3).at n=28A185019
- G.f.: A(x) = 1/(1 - x*(1+x)/(1 - x^2*(1+x)/(1 - x^3*(1+x)/(1 - x^4*(1+x)/(1 - ...))))), a continued fraction.at n=13A193021
- a(0)=1, a(n) = a(n-1) + a(2*n AND n), where AND is the bitwise AND operator.at n=33A215488