Base | Representation |
---|---|
bin | 1100010110100101001… |
… | …1000110011001000101 |
3 | 202021202222101121201012 |
4 | 3011221103012121011 |
5 | 11434111310341401 |
6 | 241254215212005 |
7 | 21222003224306 |
oct | 3055123063105 |
9 | 667688347635 |
10 | 212220012101 |
11 | 82002734159 |
12 | 35168077005 |
13 | 17020c26a76 |
14 | a3b30107ad |
15 | 57c11a38bb |
hex | 31694c6645 |
212220012101 has 8 divisors (see below), whose sum is σ = 214637002944. Its totient is φ = 209809879200.
The previous prime is 212220012097. The next prime is 212220012149. The reversal of 212220012101 is 101210022212.
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 212220012101 - 22 = 212220012097 is a prime.
It is a super-2 number, since 2×2122200121012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212220012401) 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 7 ways as a sum of consecutive naturals, for example, 1652231 + ... + 1776036.
It is an arithmetic number, because the mean of its divisors is an integer number (26829625368).
Almost surely, 2212220012101 is an apocalyptic number.
It is an amenable number.
212220012101 is a deficient number, since it is larger than the sum of its proper divisors (2416990843).
212220012101 is a wasteful number, since it uses less digits than its factorization.
212220012101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3428971.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 212220012101 its reverse (101210022212), we get a palindrome (313430034313).
The spelling of 212220012101 in words is "two hundred twelve billion, two hundred twenty million, twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •