Base | Representation |
---|---|
bin | 110010100000010011010101… |
… | …100001110110100001001000 |
3 | 1002010110122222211112001211121 |
4 | 302200103111201312201020 |
5 | 213103222040420213000 |
6 | 2104225253353205024 |
7 | 64533535660150345 |
oct | 6240232541664110 |
9 | 1063418884461747 |
10 | 222122111101000 |
11 | 64858505006760 |
12 | 20ab4905700774 |
13 | 96c3043497c16 |
14 | 3cbcaa61b37cc |
15 | 1aa2d8c3b4b1a |
hex | ca04d5876848 |
222122111101000 has 128 divisors (see below), whose sum is σ = 567737672261760. Its totient is φ = 80669041248000.
The previous prime is 222122111100991. The next prime is 222122111101043. The reversal of 222122111101000 is 101111221222.
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 31 ways as a sum of consecutive naturals, for example, 4172047 + ... + 21486046.
It is an arithmetic number, because the mean of its divisors is an integer number (4435450564545).
Almost surely, 2222122111101000 is an apocalyptic number.
222122111101000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
222122111101000 is an abundant number, since it is smaller than the sum of its proper divisors (345615561160760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
222122111101000 is a wasteful number, since it uses less digits than its factorization.
222122111101000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25658912 (or 25658898 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 222122111101000 its reverse (101111221222), we get a palindrome (222223222322222).
The spelling of 222122111101000 in words is "two hundred twenty-two trillion, one hundred twenty-two billion, one hundred eleven million, one hundred one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •