Base | Representation |
---|---|
bin | 101110101000011100… |
… | …1010000110011010001 |
3 | 100120111000210001010021 |
4 | 1131100321100303101 |
5 | 3120042201423423 |
6 | 114000534303441 |
7 | 10143412106455 |
oct | 1352071206321 |
9 | 316430701107 |
10 | 100141436113 |
11 | 39519259154 |
12 | 174a91b7b81 |
13 | 959bc00654 |
14 | 4bbdb5a665 |
15 | 291187695d |
hex | 1750e50cd1 |
100141436113 has 2 divisors, whose sum is σ = 100141436114. Its totient is φ = 100141436112.
The previous prime is 100141436099. The next prime is 100141436123. The reversal of 100141436113 is 311634141001.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 86997272209 + 13144163904 = 294953^2 + 114648^2 .
It is a cyclic number.
It is not a de Polignac number, because 100141436113 - 229 = 99604565201 is a prime.
It is not a weakly prime, because it can be changed into another prime (100141436123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50070718056 + 50070718057.
It is an arithmetic number, because the mean of its divisors is an integer number (50070718057).
Almost surely, 2100141436113 is an apocalyptic number.
It is an amenable number.
100141436113 is a deficient number, since it is larger than the sum of its proper divisors (1).
100141436113 is an equidigital number, since it uses as much as digits as its factorization.
100141436113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 25.
Adding to 100141436113 its reverse (311634141001), we get a palindrome (411775577114).
The spelling of 100141436113 in words is "one hundred billion, one hundred forty-one million, four hundred thirty-six thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •