Base | Representation |
---|---|
bin | 101110100111110000… |
… | …0010101001010010001 |
3 | 100120102101220121202022 |
4 | 1131033200111022101 |
5 | 3120020214420103 |
6 | 113554342501225 |
7 | 10143010001606 |
oct | 1351740251221 |
9 | 316371817668 |
10 | 100118123153 |
11 | 39507085844 |
12 | 174a1434815 |
13 | 959712a2b9 |
14 | 4bbaa0c6ad |
15 | 290e7be138 |
hex | 174f815291 |
100118123153 has 2 divisors, whose sum is σ = 100118123154. Its totient is φ = 100118123152.
The previous prime is 100118123141. The next prime is 100118123197. The reversal of 100118123153 is 351321811001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 67406698384 + 32711424769 = 259628^2 + 180863^2 .
It is a cyclic number.
It is not a de Polignac number, because 100118123153 - 26 = 100118123089 is a prime.
It is a super-2 number, since 2×1001181231532 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (100118123753) 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, 50059061576 + 50059061577.
It is an arithmetic number, because the mean of its divisors is an integer number (50059061577).
Almost surely, 2100118123153 is an apocalyptic number.
It is an amenable number.
100118123153 is a deficient number, since it is larger than the sum of its proper divisors (1).
100118123153 is an equidigital number, since it uses as much as digits as its factorization.
100118123153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 720, while the sum is 26.
Adding to 100118123153 its reverse (351321811001), we get a palindrome (451439934154).
The spelling of 100118123153 in words is "one hundred billion, one hundred eighteen million, one hundred twenty-three thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •