Base | Representation |
---|---|
bin | 10010110100101011… |
… | …100111100010100100 |
3 | 1221011112221110012220 |
4 | 102310223213202210 |
5 | 312343031432322 |
6 | 13141312112340 |
7 | 1313565245535 |
oct | 226453474244 |
9 | 57145843186 |
10 | 20211202212 |
11 | 8631773403 |
12 | 3b008356b0 |
13 | 1ba1384a66 |
14 | d9a38268c |
15 | 7d458955c |
hex | 4b4ae78a4 |
20211202212 has 12 divisors (see below), whose sum is σ = 47159471856. Its totient is φ = 6737067400.
The previous prime is 20211202189. The next prime is 20211202241. The reversal of 20211202212 is 21220211202.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 20211202191 and 20211202200.
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, 842133414 + ... + 842133437.
It is an arithmetic number, because the mean of its divisors is an integer number (3929955988).
Almost surely, 220211202212 is an apocalyptic number.
It is an amenable number.
20211202212 is an abundant number, since it is smaller than the sum of its proper divisors (26948269644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20211202212 is a wasteful number, since it uses less digits than its factorization.
20211202212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1684266858 (or 1684266856 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 20211202212 its reverse (21220211202), we get a palindrome (41431413414).
It can be divided in two parts, 20211202 and 212, that multiplied together give a palindrome (4284774824).
The spelling of 20211202212 in words is "twenty billion, two hundred eleven million, two hundred two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •