Base | Representation |
---|---|
bin | 11100111000100010… |
… | …011110010010100011 |
3 | 2222001101001111201210 |
4 | 130320202132102203 |
5 | 1002003403112011 |
6 | 22125231201203 |
7 | 2145352654635 |
oct | 347042362243 |
9 | 88041044653 |
10 | 31013332131 |
11 | 12175243501 |
12 | 6016376203 |
13 | 2c032bc702 |
14 | 1702c66a55 |
15 | c17a906a6 |
hex | 73889e4a3 |
31013332131 has 4 divisors (see below), whose sum is σ = 41351109512. Its totient is φ = 20675554752.
The previous prime is 31013332109. The next prime is 31013332151. The reversal of 31013332131 is 13123331013.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 31013332131 - 217 = 31013201059 is a prime.
It is a super-2 number, since 2×310133321312 (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 = 31013332098 and 31013332107.
It is not an unprimeable number, because it can be changed into a prime (31013332151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5168888686 + ... + 5168888691.
It is an arithmetic number, because the mean of its divisors is an integer number (10337777378).
Almost surely, 231013332131 is an apocalyptic number.
31013332131 is a deficient number, since it is larger than the sum of its proper divisors (10337777381).
31013332131 is a wasteful number, since it uses less digits than its factorization.
31013332131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10337777380.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 31013332131 its reverse (13123331013), we get a palindrome (44136663144).
The spelling of 31013332131 in words is "thirty-one billion, thirteen million, three hundred thirty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •