Base | Representation |
---|---|
bin | 1010000100000110110001… |
… | …11100000011101010100110 |
3 | 2220100201210010100222021020 |
4 | 11002003120330003222212 |
5 | 10400044411122200202 |
6 | 115022552312232010 |
7 | 4442635343515362 |
oct | 502033074035246 |
9 | 86321703328236 |
10 | 22131311131302 |
11 | 706292219833a |
12 | 259524339b606 |
13 | c46c87254369 |
14 | 5672383942a2 |
15 | 285a45d655bc |
hex | 1420d8f03aa6 |
22131311131302 has 16 divisors (see below), whose sum is σ = 44461109360640. Its totient is φ = 7344022527432.
The previous prime is 22131311131297. The next prime is 22131311131313. The reversal of 22131311131302 is 20313111313122.
It is a super-2 number, since 2×221313111313022 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8270294302 + ... + 8270296977.
It is an arithmetic number, because the mean of its divisors is an integer number (2778819335040).
Almost surely, 222131311131302 is an apocalyptic number.
22131311131302 is an abundant number, since it is smaller than the sum of its proper divisors (22329798229338).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22131311131302 is a wasteful number, since it uses less digits than its factorization.
22131311131302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16540591507.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 22131311131302 its reverse (20313111313122), we get a palindrome (42444422444424).
It can be divided in two parts, 2213131 and 1131302, that added together give a palindrome (3344433).
The spelling of 22131311131302 in words is "twenty-two trillion, one hundred thirty-one billion, three hundred eleven million, one hundred thirty-one thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •