Base | Representation |
---|---|
bin | 10000000000110101111010… |
… | …111001100000101101100011 |
3 | 100020100201110200021100000022 |
4 | 100000311322321200231203 |
5 | 33212332230001232214 |
6 | 405441315125144055 |
7 | 20556104544225602 |
oct | 2000657271405543 |
9 | 306321420240008 |
10 | 70426640649059 |
11 | 2049285269a462 |
12 | 7a951a355b02b |
13 | 303b2857473c6 |
14 | 135694bc47a39 |
15 | 821e5a13ed8e |
hex | 400d7ae60b63 |
70426640649059 has 2 divisors, whose sum is σ = 70426640649060. Its totient is φ = 70426640649058.
The previous prime is 70426640649007. The next prime is 70426640649121. The reversal of 70426640649059 is 95094604662407.
It is an a-pointer prime, because the next prime (70426640649121) can be obtained adding 70426640649059 to its sum of digits (62).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 70426640649059 - 28 = 70426640648803 is a prime.
It is a super-2 number, since 2×704266406490592 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 70426640648992 and 70426640649010.
It is not a weakly prime, because it can be changed into another prime (70426640649359) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 35213320324529 + 35213320324530.
It is an arithmetic number, because the mean of its divisors is an integer number (35213320324530).
Almost surely, 270426640649059 is an apocalyptic number.
70426640649059 is a deficient number, since it is larger than the sum of its proper divisors (1).
70426640649059 is an equidigital number, since it uses as much as digits as its factorization.
70426640649059 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 78382080, while the sum is 62.
The spelling of 70426640649059 in words is "seventy trillion, four hundred twenty-six billion, six hundred forty million, six hundred forty-nine thousand, fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •