Base | Representation |
---|---|
bin | 1100010110100010111… |
… | …0000011010001110101 |
3 | 202021202022010012020112 |
4 | 3011220232003101311 |
5 | 11434101314100041 |
6 | 241253231112405 |
7 | 21221524534226 |
oct | 3055056032165 |
9 | 667668105215 |
10 | 212210300021 |
11 | 81aa8200345 |
12 | 35164972705 |
13 | 1701bc06285 |
14 | a3b1a0324d |
15 | 57c03d5deb |
hex | 3168b83475 |
212210300021 has 8 divisors (see below), whose sum is σ = 223427884320. Its totient is φ = 200997577872.
The previous prime is 212210300017. The next prime is 212210300047. The reversal of 212210300021 is 120003012212.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 212210300021 - 22 = 212210300017 is a prime.
It is a super-2 number, since 2×2122103000212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 212210299969 and 212210300005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212210300011) 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, 1125770 + ... + 1300683.
It is an arithmetic number, because the mean of its divisors is an integer number (27928485540).
Almost surely, 2212210300021 is an apocalyptic number.
It is an amenable number.
212210300021 is a deficient number, since it is larger than the sum of its proper divisors (11217584299).
212210300021 is a wasteful number, since it uses less digits than its factorization.
212210300021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2431075.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 212210300021 its reverse (120003012212), we get a palindrome (332213312233).
The spelling of 212210300021 in words is "two hundred twelve billion, two hundred ten million, three hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •