Base | Representation |
---|---|
bin | 1010000011010000011000… |
… | …11011010110100010011011 |
3 | 2220020221102001200001211120 |
4 | 11001220030123112202123 |
5 | 10344110110202431021 |
6 | 115001322543100323 |
7 | 4440552615642630 |
oct | 501501433264233 |
9 | 86227361601746 |
10 | 22102110202011 |
11 | 70514a800aa24 |
12 | 258b653ba16a3 |
13 | c442b25a8188 |
14 | 565a68112187 |
15 | 284dd747d2c6 |
hex | 141a0c6d689b |
22102110202011 has 16 divisors (see below), whose sum is σ = 33679486827264. Its totient is φ = 12629746956384.
The previous prime is 22102110201989. The next prime is 22102110202033. The reversal of 22102110202011 is 11020201120122.
It is an interprime number because it is at equal distance from previous prime (22102110201989) and next prime (22102110202033).
It is not a de Polignac number, because 22102110202011 - 213 = 22102110193819 is a prime.
It is not an unprimeable number, because it can be changed into a prime (22102110200011) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10059901 + ... + 12058433.
It is an arithmetic number, because the mean of its divisors is an integer number (2104967926704).
Almost surely, 222102110202011 is an apocalyptic number.
22102110202011 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
22102110202011 is a deficient number, since it is larger than the sum of its proper divisors (11577376625253).
22102110202011 is a wasteful number, since it uses less digits than its factorization.
22102110202011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2525170.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 22102110202011 its reverse (11020201120122), we get a palindrome (33122311322133).
The spelling of 22102110202011 in words is "twenty-two trillion, one hundred two billion, one hundred ten million, two hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •