Base | Representation |
---|---|
bin | 1110001100101011101101… |
… | …11001110001011111001111 |
3 | 11002112210201200021111210020 |
4 | 13012111312321301133033 |
5 | 13043020341201143043 |
6 | 150223123523313223 |
7 | 6401503021166442 |
oct | 706256671613717 |
9 | 132483650244706 |
10 | 31222112131023 |
11 | 9a482503804a0 |
12 | 360307a21b813 |
13 | 1456303b79248 |
14 | 79d2304c3659 |
15 | 39225ad91e83 |
hex | 1c6576e717cf |
31222112131023 has 16 divisors (see below), whose sum is σ = 45414116787072. Its totient is φ = 18922435740000.
The previous prime is 31222112131019. The next prime is 31222112131069. The reversal of 31222112131023 is 32013121122213.
It is not a de Polignac number, because 31222112131023 - 22 = 31222112131019 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 31222112130984 and 31222112131002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31222112131073) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11608293 + ... + 14042673.
It is an arithmetic number, because the mean of its divisors is an integer number (2838382299192).
Almost surely, 231222112131023 is an apocalyptic number.
31222112131023 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
31222112131023 is a deficient number, since it is larger than the sum of its proper divisors (14192004656049).
31222112131023 is a wasteful number, since it uses less digits than its factorization.
31222112131023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2823046.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 31222112131023 its reverse (32013121122213), we get a palindrome (63235233253236).
The spelling of 31222112131023 in words is "thirty-one trillion, two hundred twenty-two billion, one hundred twelve million, one hundred thirty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •