Base | Representation |
---|---|
bin | 10110101111001101001100… |
… | …001001100010010110110001 |
3 | 111010002000001201002202101201 |
4 | 112233031030021202112301 |
5 | 101101404022241334301 |
6 | 552403454204131201 |
7 | 30030556013423035 |
oct | 2657151411422661 |
9 | 433060051082351 |
10 | 100001001121201 |
11 | 29955206126374 |
12 | b270a44b36b01 |
13 | 43a509168655b |
14 | 1a9a107b721c5 |
15 | b863c7623201 |
hex | 5af34c2625b1 |
100001001121201 has 2 divisors, whose sum is σ = 100001001121202. Its totient is φ = 100001001121200.
The previous prime is 100001001121183. The next prime is 100001001121303. The reversal of 100001001121201 is 102121100100001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 90707337921600 + 9293663199601 = 9524040^2 + 3048551^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100001001121201 is a prime.
It is not a weakly prime, because it can be changed into another prime (100001901121201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50000500560600 + 50000500560601.
It is an arithmetic number, because the mean of its divisors is an integer number (50000500560601).
Almost surely, 2100001001121201 is an apocalyptic number.
It is an amenable number.
100001001121201 is a deficient number, since it is larger than the sum of its proper divisors (1).
100001001121201 is an equidigital number, since it uses as much as digits as its factorization.
100001001121201 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 10.
Adding to 100001001121201 its reverse (102121100100001), we get a palindrome (202122101221202).
The spelling of 100001001121201 in words is "one hundred trillion, one billion, one million, one hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •