Base | Representation |
---|---|
bin | 111111100001100010… |
… | …0011001011101010111 |
3 | 111001010010002011221211 |
4 | 1333003010121131113 |
5 | 4213340133234101 |
6 | 142400255122251 |
7 | 12566350533211 |
oct | 1770304313527 |
9 | 431103064854 |
10 | 136416696151 |
11 | 529437399aa |
12 | 22531813387 |
13 | cb303a9568 |
14 | 68617875b1 |
15 | 383635bc51 |
hex | 1fc3119757 |
136416696151 has 2 divisors, whose sum is σ = 136416696152. Its totient is φ = 136416696150.
The previous prime is 136416696137. The next prime is 136416696167. The reversal of 136416696151 is 151696614631.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 136416696151 - 27 = 136416696023 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 136416696095 and 136416696104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (136416696181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68208348075 + 68208348076.
It is an arithmetic number, because the mean of its divisors is an integer number (68208348076).
Almost surely, 2136416696151 is an apocalyptic number.
136416696151 is a deficient number, since it is larger than the sum of its proper divisors (1).
136416696151 is an equidigital number, since it uses as much as digits as its factorization.
136416696151 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 699840, while the sum is 49.
The spelling of 136416696151 in words is "one hundred thirty-six billion, four hundred sixteen million, six hundred ninety-six thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •