10658
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
- 6
- Divisor Sum
- 16209
- Proper Divisor Sum (Aliquot Sum)
- 5551
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5256
- Möbius Function
- 0
- Radical
- 146
- 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
- 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
- Fibonacci sequence beginning 4, 15.at n=15A022133
- Triangle T(n,k) is the number of restricted growth strings (RGS) of set partitions of {1..n} that have an increase at index k (1<=k<n).at n=31A056861
- Numbers n such that n | 9^n + 8^n + 1.at n=15A057296
- If D[n] is divisor-set of n, then in set of 1+D only 2 primes occur:{2,3}; also n is not squarefree.at n=34A072607
- a(n) = 1^n + 8^n + 9^n.at n=4A074525
- Maximum number of regions into which the plane can be divided using n (concave) quadrilaterals.at n=37A077591
- a(n) = 2*prime(n)^2.at n=20A079704
- a(n) = 6*Lucas(2n) - Fibonacci(2n+2).at n=8A097512
- Numbers in base 10 that are palindromic in bases 7 and 8.at n=15A099145
- 2*p^2, for p an odd prime.at n=19A143928
- Number of n X 3 1..2 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in nonincreasing order.at n=37A166830
- Expansion of 2*(1 -4*x +14*x^2 +4*x^3 +9*x^4)/(1-x)^5.at n=9A173785
- Numbers m such that A006218(m) is a perfect square.at n=31A175345
- Numbers that are 5-digit palindromes in at least two bases.at n=11A180454
- The difference prime(i)+prime(i+1)+...+prime(i+n-1)-A002110(n), where prime(i) is the smallest prime such that the value is nonnegative.at n=53A196130
- Squares of odd primes and twice squares of odd primes.at n=45A227279
- Period of the decimal expansion of 1/p as p runs through the prime numbers of the form n^2+1 (0 by convention for the primes 2 and 5).at n=26A247585
- Even numbers which are neither primes nor perfect powers and are coprime to the sum of their divisors.at n=36A248023
- Composite numbers k such that Sum_{i=1..t-1} d(i+1)/d(i) is prime, where d(1), ..., d(t) are the divisors of k in ascending order.at n=20A255585
- Numbers of the form p * q^p where p and q are primes, in increasing order.at n=29A257404