Base | Representation |
---|---|
bin | 10110110000110011101001… |
… | …010100100101100010001001 |
3 | 111010110112000120101202201201 |
4 | 112300303221110211202021 |
5 | 101110204323112114423 |
6 | 552530210351544201 |
7 | 30041532131362423 |
oct | 2660635124454211 |
9 | 433415016352651 |
10 | 100111012223113 |
11 | 29997929569511 |
12 | b28a22752b061 |
13 | 43b257426c728 |
14 | 1aa1582605813 |
15 | b891b56b02ad |
hex | 5b0ce9525889 |
100111012223113 has 2 divisors, whose sum is σ = 100111012223114. Its totient is φ = 100111012223112.
The previous prime is 100111012223087. The next prime is 100111012223153. The reversal of 100111012223113 is 311322210111001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 78554417526649 + 21556594696464 = 8863093^2 + 4642908^2 .
It is an emirp because it is prime and its reverse (311322210111001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 100111012223113 - 29 = 100111012222601 is a prime.
It is not a weakly prime, because it can be changed into another prime (100111012223153) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50055506111556 + 50055506111557.
It is an arithmetic number, because the mean of its divisors is an integer number (50055506111557).
Almost surely, 2100111012223113 is an apocalyptic number.
It is an amenable number.
100111012223113 is a deficient number, since it is larger than the sum of its proper divisors (1).
100111012223113 is an equidigital number, since it uses as much as digits as its factorization.
100111012223113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 100111012223113 its reverse (311322210111001), we get a palindrome (411433222334114).
The spelling of 100111012223113 in words is "one hundred trillion, one hundred eleven billion, twelve million, two hundred twenty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •