Base | Representation |
---|---|
bin | 11111000110011010110000… |
… | …000101000111100010011111 |
3 | 122221022002100000022222001122 |
4 | 133012122300011013202133 |
5 | 120412002412023440111 |
6 | 1202524030344401155 |
7 | 40545030604202606 |
oct | 3706326005074237 |
9 | 587262300288048 |
10 | 136780482640031 |
11 | 3a645305654a0a |
12 | 13410b82a761bb |
13 | 5b424621a1229 |
14 | 25ac2d4184a3d |
15 | 10c2e93141cdb |
hex | 7c66b014789f |
136780482640031 has 2 divisors, whose sum is σ = 136780482640032. Its totient is φ = 136780482640030.
The previous prime is 136780482640007. The next prime is 136780482640033. The reversal of 136780482640031 is 130046284087631.
It is a strong prime.
It is an emirp because it is prime and its reverse (130046284087631) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 136780482640031 - 214 = 136780482623647 is a prime.
It is a super-2 number, since 2×1367804826400312 (a number of 29 digits) contains 22 as substring.
Together with 136780482640033, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (136780482640033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68390241320015 + 68390241320016.
It is an arithmetic number, because the mean of its divisors is an integer number (68390241320016).
Almost surely, 2136780482640031 is an apocalyptic number.
136780482640031 is a deficient number, since it is larger than the sum of its proper divisors (1).
136780482640031 is an equidigital number, since it uses as much as digits as its factorization.
136780482640031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4644864, while the sum is 53.
The spelling of 136780482640031 in words is "one hundred thirty-six trillion, seven hundred eighty billion, four hundred eighty-two million, six hundred forty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •