10809
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
- 6
- Divisor Sum
- 15626
- Proper Divisor Sum (Aliquot Sum)
- 4817
- 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
- 3603
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 68
- 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
- Numbers k such that the continued fraction for sqrt(k) has period 90.at n=21A020429
- T(2n,n), array T as in A047060.at n=6A047069
- Let Py(n)=A000330(n)=n-th square pyramidal number. Consider all integer triples (i,j,k), j >= k>0, with Py(i)=Py(j)+Py(k), ordered by increasing i; sequence gives i values.at n=41A053719
- Boris Stechkin's function.at n=29A055004
- Numbers n such that the sum of the digits of n^phi(n) is divisible by n.at n=23A109660
- Smallest number k such that k^n is equal to the sum of n consecutive primes, or 1 if it does not exist.at n=24A123112
- a(n) = 104*n + 9977.at n=8A126978
- A recursive triangle sequence: A(n,k)=k^2*(A(n - 1, k - 1) + A(n - 1, k)).at n=17A156137
- Number of partitions of n in which no parts are multiples of 6.at n=36A219601
- Combined weight, as defined at A244094, of the distinct-parts partitions of n.at n=24A234924
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 429", based on the 5-celled von Neumann neighborhood.at n=24A272113
- Products of two distinct tribonacci numbers > 1.at n=36A274433
- Numbers n such that the sum of the divisors of n is of the form m^2+1.at n=3A289290
- Numbers k such that the sum of the divisors of k is of the form m^3 + 1.at n=23A289384
- Number of n X n 0..1 arrays with every element equal to 0, 2, 3 or 4 king-move adjacent elements, with upper left element zero.at n=4A297908
- Number of nX5 0..1 arrays with every element equal to 0, 2, 3 or 4 king-move adjacent elements, with upper left element zero.at n=4A297912
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 2, 3 or 4 king-move adjacent elements, with upper left element zero.at n=40A297915
- First differences of A325056: distance in A076042 from n-th low point to the next.at n=15A324792
- a(n) = ((n+1)*3*2^(n+1) + 29*2^n + (-1)^n)/9.at n=10A348407
- Expansion of Sum_{k>0} (1/(1+x^k)^4 - 1).at n=35A363631