Base | Representation |
---|---|
bin | 110000000001101100000110… |
… | …001110000111010101000000 |
3 | 1000200212122200022212021111020 |
4 | 300001230012032013111000 |
5 | 210141131233024411222 |
6 | 2025122104023145440 |
7 | 62330210345113521 |
oct | 6001540616072500 |
9 | 1020778608767436 |
10 | 211222301013312 |
11 | 61335969405876 |
12 | 1b8343692a5280 |
13 | 90b2240018164 |
14 | 3a232dcdb6848 |
15 | 196459b95a65c |
hex | c01b06387540 |
211222301013312 has 56 divisors (see below), whose sum is σ = 558860118357792. Its totient is φ = 70407293376000.
The previous prime is 211222301013281. The next prime is 211222301013341. The reversal of 211222301013312 is 213310103222112.
It is a super-2 number, since 2×2112223010133122 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
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, 148649887 + ... + 150064097.
Almost surely, 2211222301013312 is an apocalyptic number.
It is an amenable number.
211222301013312 is an abundant number, since it is smaller than the sum of its proper divisors (347637817344480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211222301013312 is a wasteful number, since it uses less digits than its factorization.
211222301013312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2192127 (or 2192117 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 211222301013312 its reverse (213310103222112), we get a palindrome (424532404235424).
The spelling of 211222301013312 in words is "two hundred eleven trillion, two hundred twenty-two billion, three hundred one million, thirteen thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •