Base | Representation |
---|---|
bin | 10100100111101001… |
… | …110100100100000111 |
3 | 2010010222112011210020 |
4 | 110213221310210013 |
5 | 330320332023421 |
6 | 14100535230223 |
7 | 1412436560616 |
oct | 244751644407 |
9 | 63128464706 |
10 | 22140111111 |
11 | 9431574198 |
12 | 435a818373 |
13 | 211ab9aa81 |
14 | 110061387d |
15 | 898aa7dc6 |
hex | 527a74907 |
22140111111 has 8 divisors (see below), whose sum is σ = 29625203184. Its totient is φ = 14707546560.
The previous prime is 22140111079. The next prime is 22140111113. The reversal of 22140111111 is 11111104122.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 22140111111 - 25 = 22140111079 is a prime.
22140111111 is a modest number, since divided by 111111 gives 22140 as remainder.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22140111113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13130896 + ... + 13132581.
It is an arithmetic number, because the mean of its divisors is an integer number (3703150398).
Almost surely, 222140111111 is an apocalyptic number.
22140111111 is a deficient number, since it is larger than the sum of its proper divisors (7485092073).
22140111111 is a wasteful number, since it uses less digits than its factorization.
22140111111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26263761.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 22140111111 its reverse (11111104122), we get a palindrome (33251215233).
It can be divided in two parts, 2214011 and 1111, that added together give a palindrome (2215122).
The spelling of 22140111111 in words is "twenty-two billion, one hundred forty million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •