Base | Representation |
---|---|
bin | 101101100100000101010… |
… | …011000001110011111110 |
3 | 102002022222010202002112110 |
4 | 231210011103001303332 |
5 | 402300013212024042 |
6 | 10354230000514450 |
7 | 442134034101612 |
oct | 55440523016376 |
9 | 12068863662473 |
10 | 3131120033022 |
11 | aa799a6a3233 |
12 | 4269b991ba26 |
13 | 19935677a867 |
14 | ab793037342 |
15 | 566aaa9909c |
hex | 2d9054c1cfe |
3131120033022 has 16 divisors (see below), whose sum is σ = 6407873556480. Its totient is φ = 1019434429272.
The previous prime is 3131120032969. The next prime is 3131120033039. The reversal of 3131120033022 is 2203300211313.
3131120033022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×31311200330222 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 3131120033022.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6068061822 + ... + 6068062337.
It is an arithmetic number, because the mean of its divisors is an integer number (400492097280).
Almost surely, 23131120033022 is an apocalyptic number.
3131120033022 is an abundant number, since it is smaller than the sum of its proper divisors (3276753523458).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3131120033022 is a wasteful number, since it uses less digits than its factorization.
3131120033022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12136124207.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 3131120033022 its reverse (2203300211313), we get a palindrome (5334420244335).
The spelling of 3131120033022 in words is "three trillion, one hundred thirty-one billion, one hundred twenty million, thirty-three thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •