Base | Representation |
---|---|
bin | 1010000000100110111000… |
… | …11001100011011101111110 |
3 | 2212221020112002221110220012 |
4 | 11000103130121203131332 |
5 | 10341112223142023402 |
6 | 114451433035223222 |
7 | 4431151553636300 |
oct | 500233431433576 |
9 | 85836462843805 |
10 | 22011110111102 |
11 | 701694a913822 |
12 | 2575a982a7b12 |
13 | c3883c516538 |
14 | 5614b4481970 |
15 | 28285d403452 |
hex | 1404dc66377e |
22011110111102 has 48 divisors (see below), whose sum is σ = 41026264568640. Its totient is φ = 8799860708352.
The previous prime is 22011110111101. The next prime is 22011110111117. The reversal of 22011110111102 is 20111101111022.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22011110111101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 58271702 + ... + 58648217.
It is an arithmetic number, because the mean of its divisors is an integer number (854713845180).
Almost surely, 222011110111102 is an apocalyptic number.
22011110111102 is a deficient number, since it is larger than the sum of its proper divisors (19015154457538).
22011110111102 is a wasteful number, since it uses less digits than its factorization.
22011110111102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116920065 (or 116920058 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 22011110111102 its reverse (20111101111022), we get a palindrome (42122211222124).
It can be divided in two parts, 2 and 2011110111102, that multiplied together give a palindrome (4022220222204).
The spelling of 22011110111102 in words is "twenty-two trillion, eleven billion, one hundred ten million, one hundred eleven thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •