Base | Representation |
---|---|
bin | 1110001111101000001100… |
… | …10010100111001010010110 |
3 | 11002220110220202221002100022 |
4 | 13013310012102213022112 |
5 | 13101200110310011042 |
6 | 150341420514145142 |
7 | 6412014424152200 |
oct | 707640622471226 |
9 | 132813822832308 |
10 | 31323302032022 |
11 | 9a87157444850 |
12 | 361a7ba5821b2 |
13 | 1462a0c055500 |
14 | 7a40ad5a5770 |
15 | 394bce7becd2 |
hex | 1c7d064a7296 |
31323302032022 has 72 divisors (see below), whose sum is σ = 64564013756952. Its totient is φ = 11265123542400.
The previous prime is 31323302032019. The next prime is 31323302032051. The reversal of 31323302032022 is 22023020332313.
It is a super-2 number, since 2×313233020320222 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (26).
It is a junction number, because it is equal to n+sod(n) for n = 31323302031982 and 31323302032000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 85784879 + ... + 86149242.
It is an arithmetic number, because the mean of its divisors is an integer number (896722413291).
Almost surely, 231323302032022 is an apocalyptic number.
31323302032022 is an abundant number, since it is smaller than the sum of its proper divisors (33240711724930).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31323302032022 is a wasteful number, since it uses less digits than its factorization.
31323302032022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 171934174 (or 171934154 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 26.
Adding to 31323302032022 its reverse (22023020332313), we get a palindrome (53346322364335).
The spelling of 31323302032022 in words is "thirty-one trillion, three hundred twenty-three billion, three hundred two million, thirty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •