Base | Representation |
---|---|
bin | 1010000001001110001110… |
… | …10011011101110101110011 |
3 | 2220000021001001200022222112 |
4 | 11000213013103131311303 |
5 | 10341434002120431011 |
6 | 114505244525555535 |
7 | 4432530136533560 |
oct | 500470723356563 |
9 | 86007031608875 |
10 | 22032231030131 |
11 | 70248a9045903 |
12 | 2579bb1715bab |
13 | c3a8271b766a |
14 | 56251958d867 |
15 | 28319778858b |
hex | 1409c74ddd73 |
22032231030131 has 24 divisors (see below), whose sum is σ = 27135668574720. Its totient is φ = 17474768112816.
The previous prime is 22032231030109. The next prime is 22032231030157. The reversal of 22032231030131 is 13103013223022.
It is not a de Polignac number, because 22032231030131 - 230 = 22031157288307 is a prime.
It is a super-2 number, since 2×220322310301312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22032231030097 and 22032231030106.
It is not an unprimeable number, because it can be changed into a prime (22032231030101) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 44550155 + ... + 45041988.
It is an arithmetic number, because the mean of its divisors is an integer number (1130652857280).
Almost surely, 222032231030131 is an apocalyptic number.
22032231030131 is a deficient number, since it is larger than the sum of its proper divisors (5103437544589).
22032231030131 is an equidigital number, since it uses as much as digits as its factorization.
22032231030131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 89592255 (or 89592212 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 22032231030131 its reverse (13103013223022), we get a palindrome (35135244253153).
The spelling of 22032231030131 in words is "twenty-two trillion, thirty-two billion, two hundred thirty-one million, thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •