Base | Representation |
---|---|
bin | 10010101000000101… |
… | …11110111110111001 |
3 | 221210220202210020112 |
4 | 21110002332332321 |
5 | 130440000044001 |
6 | 4332142434105 |
7 | 502544423462 |
oct | 112402767671 |
9 | 27726683215 |
10 | 10000003001 |
11 | 427181729a |
12 | 1b30b92935 |
13 | c349bb951 |
14 | 6ac163d69 |
15 | 3d7dadcbb |
hex | 2540befb9 |
10000003001 has 2 divisors, whose sum is σ = 10000003002. Its totient is φ = 10000003000.
The previous prime is 10000002983. The next prime is 10000003003. The reversal of 10000003001 is 10030000001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8248998976 + 1751004025 = 90824^2 + 41845^2 .
It is a cyclic number.
It is not a de Polignac number, because 10000003001 - 26 = 10000002937 is a prime.
It is a Sophie Germain prime.
Together with 10000003003, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (10000003003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5000001500 + 5000001501.
It is an arithmetic number, because the mean of its divisors is an integer number (5000001501).
Almost surely, 210000003001 is an apocalyptic number.
It is an amenable number.
10000003001 is a deficient number, since it is larger than the sum of its proper divisors (1).
10000003001 is an equidigital number, since it uses as much as digits as its factorization.
10000003001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3, while the sum is 5.
Adding to 10000003001 its reverse (10030000001), we get a palindrome (20030003002).
It can be divided in two parts, 1000000 and 3001, that added together give a palindrome (1003001).
The spelling of 10000003001 in words is "ten billion, three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •