Base | Representation |
---|---|
bin | 10010110100000011… |
… | …00110000010110001 |
3 | 222001220111111121022 |
4 | 21122001212002301 |
5 | 131141134131001 |
6 | 4350124305225 |
7 | 505203102416 |
oct | 113201460261 |
9 | 28056444538 |
10 | 10100302001 |
11 | 43133a2429 |
12 | 1b5a6a2215 |
13 | c4c70857a |
14 | 6bb5d210d |
15 | 3e1ac211b |
hex | 25a0660b1 |
10100302001 has 2 divisors, whose sum is σ = 10100302002. Its totient is φ = 10100302000.
The previous prime is 10100301961. The next prime is 10100302013. The reversal of 10100302001 is 10020300101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6902286400 + 3198015601 = 83080^2 + 56551^2 .
It is a cyclic number.
It is not a de Polignac number, because 10100302001 - 230 = 9026560177 is a prime.
It is a super-2 number, since 2×101003020012 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10100302001.
It is not a weakly prime, because it can be changed into another prime (10100302301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050151000 + 5050151001.
It is an arithmetic number, because the mean of its divisors is an integer number (5050151001).
Almost surely, 210100302001 is an apocalyptic number.
It is an amenable number.
10100302001 is a deficient number, since it is larger than the sum of its proper divisors (1).
10100302001 is an equidigital number, since it uses as much as digits as its factorization.
10100302001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 8.
Adding to 10100302001 its reverse (10020300101), we get a palindrome (20120602102).
The spelling of 10100302001 in words is "ten billion, one hundred million, three hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •