10087
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
- 8
- Divisor Sum
- 12672
- Proper Divisor Sum (Aliquot Sum)
- 2585
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7800
- Möbius Function
- -1
- Radical
- 10087
- Omega Function (Ω)
- 3
- 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
- 223
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Number of distinct values taken by 2^2^...^2 (with n 2's and parentheses inserted in all possible ways).at n=14A002845
- Number of partitions of n that do not contain 1 as a part.at n=43A002865
- Number of partitions of n into parts not of the form 25k, 25k+6 or 25k-6. Also number of partitions with at most 5 parts of size 1 and differences between parts at distance 11 are greater than 1.at n=34A036005
- Denominators of continued fraction convergents to sqrt(707).at n=10A042361
- Numbers of the form p*q*r where p,q,r are distinct odd palindromic primes (odd terms from A002385).at n=37A046405
- In the '3x+1' problem, these values for the starting value set new records for the "dropping time", number of steps to reach a lower value than the start.at n=5A060412
- Smallest number k such that there are exactly n relatively prime numbers using all digits of k.at n=36A075604
- Bisection (odd part) of Chebyshev sequence with Diophantine property.at n=3A077250
- Combined Diophantine Chebyshev sequences A077409 and A077250.at n=7A077411
- a(n) = A083960(n)/A004151(n).at n=12A083961
- a(n) = A083960(n)/A004151(n).at n=25A083961
- a(n) = A083960(n)/A004151(n).at n=38A083961
- a(n) = A083964(n)/(2n-1).at n=6A083965
- a(n) = A083964(n)/(2n-1).at n=19A083965
- Number of partitions of n including 3, but not 1.at n=45A085811
- a(n) = -a(n-2) + 2*a(n-4) - a(n-10).at n=28A089135
- Numbers k such that k^2 = 24*j^2 + 25.at n=11A106330
- Numbers k such that the reverse of the representation of phi(k) is a substring of k, in base 10.at n=8A113622
- Number of partitions of n in which both smallest and largest part occur only once.at n=42A117995
- a(n) = 1 + Sum_{i=1..n} S2(i)*2^i, where S2(n) is digit sum of n, n in binary notation.at n=11A135570