Base | Representation |
---|---|
bin | 1010000110011001101110… |
… | …00110000000101001100110 |
3 | 2220122021102001002101202121 |
4 | 11003030313012000221212 |
5 | 10402342442223210042 |
6 | 115123120343100154 |
7 | 4451430315566416 |
oct | 503146706005146 |
9 | 86567361071677 |
10 | 22210200210022 |
11 | 7093324aaa860 |
12 | 25a859b14165a |
13 | c5154a1834b6 |
14 | 56ad9d78a646 |
15 | 287b11a42367 |
hex | 143337180a66 |
22210200210022 has 32 divisors (see below), whose sum is σ = 37417327136640. Its totient is φ = 9800269859520.
The previous prime is 22210200209969. The next prime is 22210200210043. The reversal of 22210200210022 is 22001200201222.
It is a super-2 number, since 2×222102002100222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22210200209978 and 22210200210005.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 71864247 + ... + 72172642.
It is an arithmetic number, because the mean of its divisors is an integer number (1169291473020).
Almost surely, 222210200210022 is an apocalyptic number.
22210200210022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
22210200210022 is a deficient number, since it is larger than the sum of its proper divisors (15207126926618).
22210200210022 is a wasteful number, since it uses less digits than its factorization.
22210200210022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144037108.
The product of its (nonzero) digits is 128, while the sum is 16.
Adding to 22210200210022 its reverse (22001200201222), we get a palindrome (44211400411244).
The spelling of 22210200210022 in words is "twenty-two trillion, two hundred ten billion, two hundred million, two hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •