Base | Representation |
---|---|
bin | 10010110101010101… |
… | …10111001010010110 |
3 | 222002122212010010202 |
4 | 21122222313022112 |
5 | 131201421320042 |
6 | 4351152220502 |
7 | 505364050013 |
oct | 113252671226 |
9 | 28078763122 |
10 | 10111120022 |
11 | 4319511143 |
12 | 1b6223a732 |
13 | c51a25573 |
14 | 6bcc0a70a |
15 | 3e2a0c632 |
hex | 25aab7296 |
10111120022 has 64 divisors (see below), whose sum is σ = 17351221248. Its totient is φ = 4390848000.
The previous prime is 10111120001. The next prime is 10111120049. The reversal of 10111120022 is 22002111101.
It is a junction number, because it is equal to n+sod(n) for n = 10111119985 and 10111120012.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 15296372 + ... + 15297032.
It is an arithmetic number, because the mean of its divisors is an integer number (271112832).
Almost surely, 210111120022 is an apocalyptic number.
10111120022 is a deficient number, since it is larger than the sum of its proper divisors (7240101226).
10111120022 is a wasteful number, since it uses less digits than its factorization.
10111120022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1365.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10111120022 its reverse (22002111101), we get a palindrome (32113231123).
The spelling of 10111120022 in words is "ten billion, one hundred eleven million, one hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •