Base | Representation |
---|---|
bin | 1110001100000100100111… |
… | …01111000010100100111100 |
3 | 11002110210112202210121002222 |
4 | 13012002103233002210330 |
5 | 13042144343440121340 |
6 | 150205332551104512 |
7 | 6400130602533614 |
oct | 706022357024474 |
9 | 132423482717088 |
10 | 31201121020220 |
11 | 9a3a35944a238 |
12 | 35baba0372138 |
13 | 145433a057518 |
14 | 79c1dc725a44 |
15 | 39192d0ed8b5 |
hex | 1c6093bc293c |
31201121020220 has 144 divisors (see below), whose sum is σ = 68995099857600. Its totient is φ = 11850756403200.
The previous prime is 31201121020159. The next prime is 31201121020247. The reversal of 31201121020220 is 2202012110213.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3280525265 + ... + 3280534775.
It is an arithmetic number, because the mean of its divisors is an integer number (479132637900).
Almost surely, 231201121020220 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 31201121020220, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (34497549928800).
31201121020220 is an abundant number, since it is smaller than the sum of its proper divisors (37793978837380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31201121020220 is a wasteful number, since it uses less digits than its factorization.
31201121020220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11796 (or 11771 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 31201121020220 its reverse (2202012110213), we get a palindrome (33403133130433).
The spelling of 31201121020220 in words is "thirty-one trillion, two hundred one billion, one hundred twenty-one million, twenty thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •