Base | Representation |
---|---|
bin | 10100101000110110… |
… | …001100001111001101 |
3 | 2010012101012021221101 |
4 | 110220312030033031 |
5 | 330340443143041 |
6 | 14102532303101 |
7 | 1413102001660 |
oct | 245066141715 |
9 | 63171167841 |
10 | 22160131021 |
11 | 94418a8476 |
12 | 4365471a91 |
13 | 212208a282 |
14 | 11031456d7 |
15 | 89a70eb31 |
hex | 528d8c3cd |
22160131021 has 32 divisors (see below), whose sum is σ = 26377885440. Its totient is φ = 18214834176.
The previous prime is 22160131001. The next prime is 22160131033. The reversal of 22160131021 is 12013106122.
It is not a de Polignac number, because 22160131021 - 227 = 22025913293 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 22160131021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22160131001) 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 31 ways as a sum of consecutive naturals, for example, 32444946 + ... + 32445628.
It is an arithmetic number, because the mean of its divisors is an integer number (824308920).
Almost surely, 222160131021 is an apocalyptic number.
It is an amenable number.
22160131021 is a deficient number, since it is larger than the sum of its proper divisors (4217754419).
22160131021 is a wasteful number, since it uses less digits than its factorization.
22160131021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1573.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 22160131021 its reverse (12013106122), we get a palindrome (34173237143).
It can be divided in two parts, 22160 and 131021, that added together give a triangular number (153181 = T553).
The spelling of 22160131021 in words is "twenty-two billion, one hundred sixty million, one hundred thirty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •