Base | Representation |
---|---|
bin | 1100010101110101100… |
… | …0100010101101110010 |
3 | 202021021001020122122201 |
4 | 3011131120202231302 |
5 | 11433204122042432 |
6 | 241222314453414 |
7 | 21214025135011 |
oct | 3053530425562 |
9 | 667231218581 |
10 | 212020112242 |
11 | 81a0a90a464 |
12 | 3511113426a |
13 | 16cbb6a6223 |
14 | a394656a78 |
15 | 57ad868ee7 |
hex | 315d622b72 |
212020112242 has 8 divisors (see below), whose sum is σ = 318046319856. Its totient is φ = 106004672292.
The previous prime is 212020112233. The next prime is 212020112251. The reversal of 212020112242 is 242211020212.
212020112242 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (212020112233) and next prime (212020112251).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×2120201122422 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2642508 + ... + 2721559.
It is an arithmetic number, because the mean of its divisors is an integer number (39755789982).
Almost surely, 2212020112242 is an apocalyptic number.
212020112242 is a deficient number, since it is larger than the sum of its proper divisors (106026207614).
212020112242 is a wasteful number, since it uses less digits than its factorization.
212020112242 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5383832.
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 212020112242 its reverse (242211020212), we get a palindrome (454231132454).
The spelling of 212020112242 in words is "two hundred twelve billion, twenty million, one hundred twelve thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •