Base | Representation |
---|---|
bin | 10110101111010101100101… |
… | …000111101011101010000001 |
3 | 111010002212022112220012211111 |
4 | 112233111211013223222001 |
5 | 101102031000030000001 |
6 | 552411544143443321 |
7 | 30031325164553563 |
oct | 2657254507535201 |
9 | 433085275805744 |
10 | 100010010000001 |
11 | 29959009431352 |
12 | b272739bb6541 |
13 | 43a5b98c24c7a |
14 | 1a9a720419333 |
15 | b867534a5851 |
hex | 5af5651eba81 |
100010010000001 has 2 divisors, whose sum is σ = 100010010000002. Its totient is φ = 100010010000000.
The previous prime is 100010009999987. The next prime is 100010010000013. The reversal of 100010010000001 is 100000010010001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 86304843201600 + 13705166798401 = 9290040^2 + 3702049^2 .
It is a cyclic number.
It is not a de Polignac number, because 100010010000001 - 27 = 100010009999873 is a prime.
It is not a weakly prime, because it can be changed into another prime (100010010000101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50005005000000 + 50005005000001.
It is an arithmetic number, because the mean of its divisors is an integer number (50005005000001).
Almost surely, 2100010010000001 is an apocalyptic number.
It is an amenable number.
100010010000001 is a deficient number, since it is larger than the sum of its proper divisors (1).
100010010000001 is an equidigital number, since it uses as much as digits as its factorization.
100010010000001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1, while the sum is 4.
Adding to 100010010000001 its reverse (100000010010001), we get a palindrome (200010020010002).
It can be divided in two parts, 1000 and 10010000001, that added together give a palindrome (10010001001).
The spelling of 100010010000001 in words is "one hundred trillion, ten billion, ten million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •