Base | Representation |
---|---|
bin | 11110111100111111000111… |
… | …111111000000110001100011 |
3 | 122212000010101002102212120001 |
4 | 132330333013333000301203 |
5 | 120320343014432142242 |
6 | 1201310200232200431 |
7 | 40450144244421406 |
oct | 3674770777006143 |
9 | 585003332385501 |
10 | 136132343630947 |
11 | 3a415448020394 |
12 | 1332743a539117 |
13 | 5ac62c01ca081 |
14 | 2588baa801d3d |
15 | 10b11abed3eb7 |
hex | 7bcfc7fc0c63 |
136132343630947 has 2 divisors, whose sum is σ = 136132343630948. Its totient is φ = 136132343630946.
The previous prime is 136132343630873. The next prime is 136132343630953. The reversal of 136132343630947 is 749036343231631.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 136132343630947 - 27 = 136132343630819 is a prime.
It is a super-2 number, since 2×1361323436309472 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (136132343630147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68066171815473 + 68066171815474.
It is an arithmetic number, because the mean of its divisors is an integer number (68066171815474).
Almost surely, 2136132343630947 is an apocalyptic number.
136132343630947 is a deficient number, since it is larger than the sum of its proper divisors (1).
136132343630947 is an equidigital number, since it uses as much as digits as its factorization.
136132343630947 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17635968, while the sum is 55.
The spelling of 136132343630947 in words is "one hundred thirty-six trillion, one hundred thirty-two billion, three hundred forty-three million, six hundred thirty thousand, nine hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •