Base | Representation |
---|---|
bin | 100000101100010011… |
… | …1011101010000101101 |
3 | 20201012210101020222002 |
4 | 1001120213131100231 |
5 | 2122240242341323 |
6 | 52130254502045 |
7 | 5033526661121 |
oct | 1013047352055 |
9 | 221183336862 |
10 | 70206215213 |
11 | 2785763a672 |
12 | 11733b04925 |
13 | 680b0998a4 |
14 | 3580175581 |
15 | 1c5d796828 |
hex | 10589dd42d |
70206215213 has 4 divisors (see below), whose sum is σ = 70314726240. Its totient is φ = 70097704188.
The previous prime is 70206215207. The next prime is 70206215237. The reversal of 70206215213 is 31251260207.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 31251260207 = 53 ⋅589646419.
It is a cyclic number.
It is not a de Polignac number, because 70206215213 - 28 = 70206214957 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (70206215203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 54254543 + ... + 54255836.
It is an arithmetic number, because the mean of its divisors is an integer number (17578681560).
Almost surely, 270206215213 is an apocalyptic number.
It is an amenable number.
70206215213 is a deficient number, since it is larger than the sum of its proper divisors (108511027).
70206215213 is a wasteful number, since it uses less digits than its factorization.
70206215213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108511026.
The product of its (nonzero) digits is 5040, while the sum is 29.
The spelling of 70206215213 in words is "seventy billion, two hundred six million, two hundred fifteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •