Base | Representation |
---|---|
bin | 11111111011100000010101… |
… | …00001111000101101101110 |
3 | 100012121102101102122212000022 |
4 | 33331300022201320231232 |
5 | 33200342342303311342 |
6 | 405200001031202142 |
7 | 20534546600456606 |
oct | 1775601241705556 |
9 | 305542342585008 |
10 | 70214302010222 |
11 | 2041079a002287 |
12 | 7a60003816352 |
13 | 3024246087806 |
14 | 134a567197c06 |
15 | 81b67d8579d2 |
hex | 3fdc0a878b6e |
70214302010222 has 8 divisors (see below), whose sum is σ = 105321651760272. Its totient is φ = 35107084756800.
The previous prime is 70214302010221. The next prime is 70214302010233. The reversal of 70214302010222 is 22201020341207.
70214302010222 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 70214302010191 and 70214302010200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (70214302010221) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 31788554 + ... + 33925517.
It is an arithmetic number, because the mean of its divisors is an integer number (13165206470034).
Almost surely, 270214302010222 is an apocalyptic number.
70214302010222 is a deficient number, since it is larger than the sum of its proper divisors (35107349750050).
70214302010222 is a wasteful number, since it uses less digits than its factorization.
70214302010222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66248314.
The product of its (nonzero) digits is 2688, while the sum is 26.
Adding to 70214302010222 its reverse (22201020341207), we get a palindrome (92415322351429).
The spelling of 70214302010222 in words is "seventy trillion, two hundred fourteen billion, three hundred two million, ten thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •