Base | Representation |
---|---|
bin | 11110110110100110100… |
… | …010110111000011111101 |
3 | 21111200122021212200002112 |
4 | 132312212202313003331 |
5 | 234214144014030323 |
6 | 4302002403303405 |
7 | 306115566266402 |
oct | 36664642670375 |
9 | 7450567780075 |
10 | 2120213033213 |
11 | 7481a4a8aa10 |
12 | 2a2ab307ab65 |
13 | 124c2091a0a2 |
14 | 7489420c2a9 |
15 | 3a241a14178 |
hex | 1eda68b70fd |
2120213033213 has 8 divisors (see below), whose sum is σ = 2313008103360. Its totient is φ = 1927426034880.
The previous prime is 2120213033201. The next prime is 2120213033231. The reversal of 2120213033213 is 3123303120212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2120213033213 - 232 = 2115918065917 is a prime.
It is a super-2 number, since 2×21202130332132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2120213033273) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1462073 + ... + 2525486.
It is an arithmetic number, because the mean of its divisors is an integer number (289126012920).
Almost surely, 22120213033213 is an apocalyptic number.
It is an amenable number.
2120213033213 is a deficient number, since it is larger than the sum of its proper divisors (192795070147).
2120213033213 is a wasteful number, since it uses less digits than its factorization.
2120213033213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4035907.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 2120213033213 its reverse (3123303120212), we get a palindrome (5243516153425).
The spelling of 2120213033213 in words is "two trillion, one hundred twenty billion, two hundred thirteen million, thirty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •