Base | Representation |
---|---|
bin | 10100011111111001… |
… | …111111001010100110 |
3 | 2002210220221111202010 |
4 | 110133321333022212 |
5 | 330034043143420 |
6 | 14040013255050 |
7 | 1406301012312 |
oct | 243771771246 |
9 | 62726844663 |
10 | 22010131110 |
11 | 9375166300 |
12 | 4323194486 |
13 | 20c9c8b426 |
14 | 10cb25ab42 |
15 | 88c4804e0 |
hex | 51fe7f2a6 |
22010131110 has 96 divisors (see below), whose sum is σ = 58321057536. Its totient is φ = 5312084800.
The previous prime is 22010131109. The next prime is 22010131111. The reversal of 22010131110 is 1113101022.
It is an interprime number because it is at equal distance from previous prime (22010131109) and next prime (22010131111).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22010131111) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 810655 + ... + 837365.
It is an arithmetic number, because the mean of its divisors is an integer number (607511016).
Almost surely, 222010131110 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 22010131110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29160528768).
22010131110 is an abundant number, since it is smaller than the sum of its proper divisors (36310926426).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22010131110 is a wasteful number, since it uses less digits than its factorization.
22010131110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26970 (or 26959 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 22010131110 its reverse (1113101022), we get a palindrome (23123232132).
The spelling of 22010131110 in words is "twenty-two billion, ten million, one hundred thirty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •