Base | Representation |
---|---|
bin | 11111111011010011000111… |
… | …11011101010110100111101 |
3 | 100012120202002022120100121220 |
4 | 33331221203323222310331 |
5 | 33200233332233203332 |
6 | 405152425315543553 |
7 | 20534206106441502 |
oct | 1775514373526475 |
9 | 305522068510556 |
10 | 70207212006717 |
11 | 20408790974755 |
12 | 7a5a7652babb9 |
13 | 302368622b176 |
14 | 134a0936cd4a9 |
15 | 81b3b61b0d2c |
hex | 3fda63eead3d |
70207212006717 has 8 divisors (see below), whose sum is σ = 94891939516224. Its totient is φ = 46163646250848.
The previous prime is 70207212006667. The next prime is 70207212006721. The reversal of 70207212006717 is 71760021270207.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 70207212006717 - 215 = 70207211973949 is a prime.
It is a super-2 number, since 2×702072120067172 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (70207212026717) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 160290438153 + ... + 160290438590.
It is an arithmetic number, because the mean of its divisors is an integer number (11861492439528).
Almost surely, 270207212006717 is an apocalyptic number.
It is an amenable number.
70207212006717 is a deficient number, since it is larger than the sum of its proper divisors (24684727509507).
70207212006717 is a wasteful number, since it uses less digits than its factorization.
70207212006717 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 320580876819.
The product of its (nonzero) digits is 115248, while the sum is 42.
The spelling of 70207212006717 in words is "seventy trillion, two hundred seven billion, two hundred twelve million, six thousand, seven hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •