Base | Representation |
---|---|
bin | 111111100111101111… |
… | …1000010001010010111 |
3 | 111001122122001101021001 |
4 | 1333033133002022113 |
5 | 4214302000131312 |
6 | 142433100004131 |
7 | 12604460245225 |
oct | 1771737021227 |
9 | 431578041231 |
10 | 136625005207 |
11 | 52a40287649 |
12 | 2258b530647 |
13 | cb645b2862 |
14 | 68812cdb15 |
15 | 38497a8057 |
hex | 1fcf7c2297 |
136625005207 has 2 divisors, whose sum is σ = 136625005208. Its totient is φ = 136625005206.
The previous prime is 136625005199. The next prime is 136625005217. The reversal of 136625005207 is 702500526631.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 136625005207 - 23 = 136625005199 is a prime.
It is a super-2 number, since 2×1366250052072 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (136625005217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68312502603 + 68312502604.
It is an arithmetic number, because the mean of its divisors is an integer number (68312502604).
Almost surely, 2136625005207 is an apocalyptic number.
136625005207 is a deficient number, since it is larger than the sum of its proper divisors (1).
136625005207 is an equidigital number, since it uses as much as digits as its factorization.
136625005207 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 75600, while the sum is 37.
The spelling of 136625005207 in words is "one hundred thirty-six billion, six hundred twenty-five million, five thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •