10827
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 16080
- Proper Divisor Sum (Aliquot Sum)
- 5253
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7200
- Möbius Function
- 0
- Radical
- 1203
- Omega Function (Ω)
- 4
- 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
- 42
- 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
- Expansion of e.g.f.: log(1+tan(x)*cosh(x)).at n=7A009375
- E.g.f. log(sech(x) + tan(x)).at n=7A013204
- [ exp(13/17)*n! ].at n=6A030887
- Numbers k such that the decimal part of k^(1/8) starts with a 'nine digits' anagram.at n=3A034283
- Smallest of 4 consecutive numbers each divisible by a square.at n=17A070284
- If p(x) is the x-th prime, then the n-th set of 4 consecutive sexy prime pairs starts at p(a(n)).at n=16A095963
- If p(x) is the x-th prime, then the n-th set of 5 consecutive sexy prime pairs starts at p(a(n)).at n=3A095964
- Numbers n for which there are exactly five k such that n = k + (product of nonzero digits of k).at n=37A096926
- Number of nX4 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 0,2,1,1,1 for x=0,1,2,3,4.at n=6A197885
- Number of nX7 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 0,2,1,1,1 for x=0,1,2,3,4.at n=3A197888
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 0,2,1,1,1 for x=0,1,2,3,4.at n=48A197889
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 0,2,1,1,1 for x=0,1,2,3,4.at n=51A197889
- Number of partitions of n such that m(1) > m(2), where m = multiplicity.at n=36A240056
- A256056(n)/2.at n=29A256055
- Expansion of Product_{k>=1} 1/(1 - x^k)^(d(k)-1), where d(k) = number of divisors of k (A000005).at n=31A318783
- a(0) = 1; a(n) = a(n-1) + a(floor(n/2)) + 1.at n=43A346912
- Number of odd-length integer partitions of n with a unique mode.at n=38A363726
- Place n points in general position on each side of an equilateral triangle, and join every pair of the 3*n+3 boundary points by a chord; sequence gives number of vertices in the resulting planar graph.at n=8A367117
- Table read by antidiagonals: Place k points in general position on each side of a regular n-gon and join every pair of the n*(k+1) boundary points by a chord; T(n,k) (n >= 3, k >= 0) gives number of vertices in the resulting planar graph.at n=36A367183
- Indices where the cumulative sum of cos(2k+1)^(2k+1) reaches a record low value.at n=15A389560