Base | Representation |
---|---|
bin | 110000000000001101111101… |
… | …011101000111100011110110 |
3 | 1000200111222202222021120001111 |
4 | 300000031331131013203312 |
5 | 210133002230342020042 |
6 | 2025003430041545234 |
7 | 62320001461415212 |
oct | 6000157535074366 |
9 | 1020458688246044 |
10 | 211121222220022 |
11 | 612a700a02a374 |
12 | 1b81885a1a521a |
13 | 90a5851b714ba |
14 | 3a1c470977942 |
15 | 1961b32b78517 |
hex | c0037d7478f6 |
211121222220022 has 16 divisors (see below), whose sum is σ = 344844101631600. Its totient is φ = 96556348455840.
The previous prime is 211121222219989. The next prime is 211121222220059. The reversal of 211121222220022 is 220022222121112.
211121222220022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2111212222200222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 211121222219975 and 211121222220002.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 95790027129 + ... + 95790029332.
It is an arithmetic number, because the mean of its divisors is an integer number (21552756351975).
Almost surely, 2211121222220022 is an apocalyptic number.
211121222220022 is a deficient number, since it is larger than the sum of its proper divisors (133722879411578).
211121222220022 is a wasteful number, since it uses less digits than its factorization.
211121222220022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 191580056511.
The product of its (nonzero) digits is 512, while the sum is 22.
Adding to 211121222220022 its reverse (220022222121112), we get a palindrome (431143444341134).
The spelling of 211121222220022 in words is "two hundred eleven trillion, one hundred twenty-one billion, two hundred twenty-two million, two hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •