Base | Representation |
---|---|
bin | 101110100100100001… |
… | …1111101010001110001 |
3 | 100120010212111111211221 |
4 | 1131021003331101301 |
5 | 3114310031201001 |
6 | 113535521505041 |
7 | 10140225106111 |
oct | 1351103752161 |
9 | 316125444757 |
10 | 100010022001 |
11 | 3946106084a |
12 | 174711a2181 |
13 | 957a90b316 |
14 | 4baa50d041 |
15 | 29050691a1 |
hex | 17490fd471 |
100010022001 has 2 divisors, whose sum is σ = 100010022002. Its totient is φ = 100010022000.
The previous prime is 100010021987. The next prime is 100010022019. The reversal of 100010022001 is 100220010001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 98314229601 + 1695792400 = 313551^2 + 41180^2 .
It is a cyclic number.
It is not a de Polignac number, because 100010022001 - 27 = 100010021873 is a prime.
It is not a weakly prime, because it can be changed into another prime (100010022061) 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, 50005011000 + 50005011001.
It is an arithmetic number, because the mean of its divisors is an integer number (50005011001).
Almost surely, 2100010022001 is an apocalyptic number.
It is an amenable number.
100010022001 is a deficient number, since it is larger than the sum of its proper divisors (1).
100010022001 is an equidigital number, since it uses as much as digits as its factorization.
100010022001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 7.
Adding to 100010022001 its reverse (100220010001), we get a palindrome (200230032002).
The spelling of 100010022001 in words is "one hundred billion, ten million, twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •