Base | Representation |
---|---|
bin | 110000001110110001000100… |
… | …111010100010100000000010 |
3 | 1000211001120101021110102002021 |
4 | 300032301010322202200002 |
5 | 210300342302224324302 |
6 | 2031051013111112054 |
7 | 62452144102054453 |
oct | 6016610472424002 |
9 | 1024046337412067 |
10 | 212121001011202 |
11 | 616520140a6858 |
12 | 1b95a57a07262a |
13 | 9148c0336833a |
14 | 3a549d587b12a |
15 | 197cb49c96437 |
hex | c0ec44ea2802 |
212121001011202 has 8 divisors (see below), whose sum is σ = 318487739731200. Its totient is φ = 105958421100804.
The previous prime is 212121001011181. The next prime is 212121001011251. The reversal of 212121001011202 is 202110100121212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×2121210010112023 (a number of 44 digits) contains 333 as substring.
It is an unprimeable number.
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, 51039699802 + ... + 51039703957.
It is an arithmetic number, because the mean of its divisors is an integer number (39810967466400).
Almost surely, 2212121001011202 is an apocalyptic number.
212121001011202 is a deficient number, since it is larger than the sum of its proper divisors (106366738719998).
212121001011202 is a wasteful number, since it uses less digits than its factorization.
212121001011202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102079404800.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 212121001011202 its reverse (202110100121212), we get a palindrome (414231101132414).
It can be divided in two parts, 2121210010 and 11202, that added together give a palindrome (2121221212).
The spelling of 212121001011202 in words is "two hundred twelve trillion, one hundred twenty-one billion, one million, eleven thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •