Base | Representation |
---|---|
bin | 100110010101… |
… | …110110111001 |
3 | 200220122101022 |
4 | 212111312321 |
5 | 10033113001 |
6 | 555232225 |
7 | 151301132 |
oct | 46256671 |
9 | 20818338 |
10 | 10051001 |
11 | 5745514 |
12 | 3448675 |
13 | 210bb4c |
14 | 1498c89 |
15 | d3811b |
hex | 995db9 |
10051001 has 2 divisors, whose sum is σ = 10051002. Its totient is φ = 10051000.
The previous prime is 10050991. The next prime is 10051003. The reversal of 10051001 is 10015001.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7295401 + 2755600 = 2701^2 + 1660^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10051001 is a prime.
It is a super-2 number, since 2×100510012 = 202045242204002, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 10051003, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10051001.
It is not a weakly prime, because it can be changed into another prime (10051003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5025500 + 5025501.
It is an arithmetic number, because the mean of its divisors is an integer number (5025501).
Almost surely, 210051001 is an apocalyptic number.
It is an amenable number.
10051001 is a deficient number, since it is larger than the sum of its proper divisors (1).
10051001 is an equidigital number, since it uses as much as digits as its factorization.
10051001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5, while the sum is 8.
The square root of 10051001 is about 3170.3313706930. The cubic root of 10051001 is about 215.8091091842.
Adding to 10051001 its reverse (10015001), we get a palindrome (20066002).
The spelling of 10051001 in words is "ten million, fifty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •