Base | Representation |
---|---|
bin | 11100111111000001… |
… | …011110010110010011 |
3 | 2222022221202121120001 |
4 | 130333001132112103 |
5 | 1002214230402011 |
6 | 22144115030431 |
7 | 2151143446642 |
oct | 347701362623 |
9 | 88287677501 |
10 | 31122122131 |
11 | 12220698aa1 |
12 | 604689b417 |
13 | 2c1c9c00a9 |
14 | 17134a5359 |
15 | c223ce7c1 |
hex | 73f05e593 |
31122122131 has 4 divisors (see below), whose sum is σ = 31122594832. Its totient is φ = 31121649432.
The previous prime is 31122122111. The next prime is 31122122149. The reversal of 31122122131 is 13122122113.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13122122113 = 37 ⋅354651949.
It is a cyclic number.
It is not a de Polignac number, because 31122122131 - 229 = 30585251219 is a prime.
It is a super-2 number, since 2×311221221312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 31122122099 and 31122122108.
It is not an unprimeable number, because it can be changed into a prime (31122122111) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 117756 + ... + 275881.
It is an arithmetic number, because the mean of its divisors is an integer number (7780648708).
Almost surely, 231122122131 is an apocalyptic number.
31122122131 is a deficient number, since it is larger than the sum of its proper divisors (472701).
31122122131 is an equidigital number, since it uses as much as digits as its factorization.
31122122131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 472700.
The product of its digits is 144, while the sum is 19.
Adding to 31122122131 its reverse (13122122113), we get a palindrome (44244244244).
The spelling of 31122122131 in words is "thirty-one billion, one hundred twenty-two million, one hundred twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •