10807
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
- 4
- Divisor Sum
- 11016
- Proper Divisor Sum (Aliquot Sum)
- 209
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10600
- Möbius Function
- 1
- Radical
- 10807
- Omega Function (Ω)
- 2
- 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
- 73
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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 that can be expressed as the product of two 3-digit numbers in at least one way.at n=21A033829
- a(n) = prime(n)*prime(n+2).at n=25A090076
- Numbers n such that n and its reversal are distinct brilliant numbers (A078972).at n=16A097435
- Product of the n-th sexy prime pair.at n=16A111192
- Brilliant numbers (A078972) which are the sum of distinct double factorials (A006882).at n=42A115652
- Both n and the reverse of n are brilliant numbers (A078972).at n=27A115655
- The numerator of determinant of n X n matrix with elements M[i,j] = 1/(Prime[i] + Prime[j]), i,j=1..n.at n=28A120270
- Numbers having exactly two distinct prime factors p, q with q = p+6.at n=32A143205
- Second bisection of A061039.at n=50A144450
- Partial sums of A151779.at n=41A151781
- a(n) = prime(n) times the n-th nonnegative noncomposite.at n=27A176098
- Numbers n such that exactly two positive d in the range d <= n/2 exist which divide binomial(n-d-1, d-1) and which are not coprime to n.at n=26A178098
- Numbers with largest and smallest prime factors differing by 6.at n=42A195118
- Numbers n such that n^2 + 1 is divisible by a 4th power.at n=35A218563
- Number of (n+5)X9 0..1 matrices with each 6X6 subblock idempotent.at n=7A224573
- S_5 sequence in partition of integers > 1 described in A240521.at n=31A240522
- Number of partitions p = [x(1), ..., x(k)], where x(1) >= x(2) >= ... >= x(k), of n such that max(x(i) - x(i-1)) = number of parts of p.at n=54A241830
- Composite numbers n such that every divisor of n greater than one contains the digit 0.at n=3A243819
- Semiprimes whose prime factors are of equal binary length and which differ from each other in exactly three bit positions.at n=28A261075
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 478", based on the 5-celled von Neumann neighborhood.at n=28A272453