Base | Representation |
---|---|
bin | 11111111000110000111111… |
… | …00111000101101101110001 |
3 | 100012021102101221221011001121 |
4 | 33330120133213011231301 |
5 | 33142322100100241332 |
6 | 405044432034502241 |
7 | 20525005043224012 |
oct | 1774303747055561 |
9 | 305242357834047 |
10 | 70120166415217 |
11 | 20384882a04486 |
12 | 7a45911a34981 |
13 | 30183c35197c9 |
14 | 1345b96d2b009 |
15 | 818ebe3be797 |
hex | 3fc61f9c5b71 |
70120166415217 has 2 divisors, whose sum is σ = 70120166415218. Its totient is φ = 70120166415216.
The previous prime is 70120166415163. The next prime is 70120166415241. The reversal of 70120166415217 is 71251466102107.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 43604680251456 + 26515486163761 = 6603384^2 + 5149319^2 .
It is an emirp because it is prime and its reverse (71251466102107) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-70120166415217 is a prime.
It is a super-2 number, since 2×701201664152172 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (70120169415217) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 35060083207608 + 35060083207609.
It is an arithmetic number, because the mean of its divisors is an integer number (35060083207609).
Almost surely, 270120166415217 is an apocalyptic number.
It is an amenable number.
70120166415217 is a deficient number, since it is larger than the sum of its proper divisors (1).
70120166415217 is an equidigital number, since it uses as much as digits as its factorization.
70120166415217 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 141120, while the sum is 43.
The spelling of 70120166415217 in words is "seventy trillion, one hundred twenty billion, one hundred sixty-six million, four hundred fifteen thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •