Base | Representation |
---|---|
bin | 11110111100100010011011… |
… | …001111100101000011001111 |
3 | 122211220011211111211012200112 |
4 | 132330202123033211003033 |
5 | 120314341412211244142 |
6 | 1201244102351150235 |
7 | 40445003514004544 |
oct | 3674423317450317 |
9 | 584804744735615 |
10 | 136101528228047 |
11 | 3a403374586068 |
12 | 1332147a51537b |
13 | 5ac341bc1b265 |
14 | 25874c5d7cbcb |
15 | 10b04a69de382 |
hex | 7bc89b3e50cf |
136101528228047 has 2 divisors, whose sum is σ = 136101528228048. Its totient is φ = 136101528228046.
The previous prime is 136101528228041. The next prime is 136101528228103. The reversal of 136101528228047 is 740822825101631.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 136101528228047 - 216 = 136101528162511 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 136101528227986 and 136101528228004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (136101528228041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68050764114023 + 68050764114024.
It is an arithmetic number, because the mean of its divisors is an integer number (68050764114024).
Almost surely, 2136101528228047 is an apocalyptic number.
136101528228047 is a deficient number, since it is larger than the sum of its proper divisors (1).
136101528228047 is an equidigital number, since it uses as much as digits as its factorization.
136101528228047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1290240, while the sum is 50.
The spelling of 136101528228047 in words is "one hundred thirty-six trillion, one hundred one billion, five hundred twenty-eight million, two hundred twenty-eight thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •