Base | Representation |
---|---|
bin | 1100010101110011011… |
… | …0101000010001101000 |
3 | 202021020102111222200221 |
4 | 3011130312220101220 |
5 | 11433144333101440 |
6 | 241221400135424 |
7 | 21213556440205 |
oct | 3053466502150 |
9 | 667212458627 |
10 | 212011222120 |
11 | 81a05898155 |
12 | 3510a167574 |
13 | 16cb98b28b9 |
14 | a3933c0cac |
15 | 57acbaed4a |
hex | 315cda8468 |
212011222120 has 32 divisors (see below), whose sum is σ = 505085560200. Its totient is φ = 79815989248.
The previous prime is 212011222117. The next prime is 212011222169. The reversal of 212011222120 is 21222110212.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 204790641444 + 7220580676 = 452538^2 + 84974^2 .
It is a junction number, because it is equal to n+sod(n) for n = 212011222094 and 212011222103.
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 7 ways as a sum of consecutive naturals, for example, 155889925 + ... + 155891284.
Almost surely, 2212011222120 is an apocalyptic number.
212011222120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
212011222120 is an abundant number, since it is smaller than the sum of its proper divisors (293074338080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212011222120 is a wasteful number, since it uses less digits than its factorization.
212011222120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 311781237 (or 311781233 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 212011222120 its reverse (21222110212), we get a palindrome (233233332332).
The spelling of 212011222120 in words is "two hundred twelve billion, eleven million, two hundred twenty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •