Base | Representation |
---|---|
bin | 1100010101110011111… |
… | …0001011101001100101 |
3 | 202021020120020120121121 |
4 | 3011130332023221211 |
5 | 11433200334431041 |
6 | 241221510413541 |
7 | 21213612324415 |
oct | 3053476135145 |
9 | 667216216547 |
10 | 212013202021 |
11 | 81a06a1a735 |
12 | 3510a9612b1 |
13 | 16cba126b3a |
14 | a393778645 |
15 | 57ace517d1 |
hex | 315cf8ba65 |
212013202021 has 4 divisors (see below), whose sum is σ = 212027221600. Its totient is φ = 211999182444.
The previous prime is 212013201893. The next prime is 212013202099. The reversal of 212013202021 is 120202310212.
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.
It is a cyclic number.
It is not a de Polignac number, because 212013202021 - 27 = 212013201893 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 212013201986 and 212013202004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212013002021) 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, 6987081 + ... + 7017358.
It is an arithmetic number, because the mean of its divisors is an integer number (53006805400).
Almost surely, 2212013202021 is an apocalyptic number.
It is an amenable number.
212013202021 is a deficient number, since it is larger than the sum of its proper divisors (14019579).
212013202021 is a wasteful number, since it uses less digits than its factorization.
212013202021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14019578.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 212013202021 its reverse (120202310212), we get a palindrome (332215512233).
The spelling of 212013202021 in words is "two hundred twelve billion, thirteen million, two hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.142 sec. • engine limits •