Base | Representation |
---|---|
bin | 1110001001110001101000… |
… | …11101100110100001101110 |
3 | 11002012020212112211002220011 |
4 | 13010320310131212201232 |
5 | 13034401243034431110 |
6 | 150105203010443434 |
7 | 6361335312253546 |
oct | 704706435464156 |
9 | 132166775732804 |
10 | 31122213202030 |
11 | 9a09946aa8555 |
12 | 35a783a29357a |
13 | 1449a73296942 |
14 | 798474a52326 |
15 | 38e86096e48a |
hex | 1c4e3476686e |
31122213202030 has 16 divisors (see below), whose sum is σ = 56020573509840. Its totient is φ = 12448754226112.
The previous prime is 31122213202009. The next prime is 31122213202037. The reversal of 31122213202030 is 3020231222113.
It is a super-2 number, since 2×311222132020302 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 31122213201992 and 31122213202010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31122213202037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15381535 + ... + 17286874.
It is an arithmetic number, because the mean of its divisors is an integer number (3501285844365).
Almost surely, 231122213202030 is an apocalyptic number.
31122213202030 is a deficient number, since it is larger than the sum of its proper divisors (24898360307810).
31122213202030 is a wasteful number, since it uses less digits than its factorization.
31122213202030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32763683.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 31122213202030 its reverse (3020231222113), we get a palindrome (34142444424143).
The spelling of 31122213202030 in words is "thirty-one trillion, one hundred twenty-two billion, two hundred thirteen million, two hundred two thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •