Base | Representation |
---|---|
bin | 11110111100100010011011… |
… | …001111100101000100000111 |
3 | 122211220011211111211012202121 |
4 | 132330202123033211010013 |
5 | 120314341412211244403 |
6 | 1201244102351150411 |
7 | 40445003514004654 |
oct | 3674423317450407 |
9 | 584804744735677 |
10 | 136101528228103 |
11 | 3a403374586109 |
12 | 1332147a515407 |
13 | 5ac341bc1b2a9 |
14 | 25874c5d7cc2b |
15 | 10b04a69de3bd |
hex | 7bc89b3e5107 |
136101528228103 has 2 divisors, whose sum is σ = 136101528228104. Its totient is φ = 136101528228102.
The previous prime is 136101528228047. The next prime is 136101528228131. The reversal of 136101528228103 is 301822825101631.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 136101528228103 - 221 = 136101526130951 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 136101528228103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (136101528228163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68050764114051 + 68050764114052.
It is an arithmetic number, because the mean of its divisors is an integer number (68050764114052).
Almost surely, 2136101528228103 is an apocalyptic number.
136101528228103 is a deficient number, since it is larger than the sum of its proper divisors (1).
136101528228103 is an equidigital number, since it uses as much as digits as its factorization.
136101528228103 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 138240, while the sum is 43.
The spelling of 136101528228103 in words is "one hundred thirty-six trillion, one hundred one billion, five hundred twenty-eight million, two hundred twenty-eight thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •