Base | Representation |
---|---|
bin | 11100111000011101… |
… | …100000101010011011 |
3 | 2222001021121102002121 |
4 | 130320131200222123 |
5 | 1002003034444011 |
6 | 22125143242111 |
7 | 2145335625634 |
oct | 347035405233 |
9 | 88037542077 |
10 | 31012031131 |
11 | 12174534aa4 |
12 | 6015a49337 |
13 | 2c02c554a3 |
14 | 1702a0888b |
15 | c178d4e71 |
hex | 738760a9b |
31012031131 has 4 divisors (see below), whose sum is σ = 32012419264. Its totient is φ = 30011643000.
The previous prime is 31012031129. The next prime is 31012031153. The reversal of 31012031131 is 13113021013.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13113021013 = 5399 ⋅2428787.
It is a cyclic number.
It is not a de Polignac number, because 31012031131 - 21 = 31012031129 is a prime.
It is a super-2 number, since 2×310120311312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (31012031101) 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, 500194020 + ... + 500194081.
It is an arithmetic number, because the mean of its divisors is an integer number (8003104816).
Almost surely, 231012031131 is an apocalyptic number.
31012031131 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
31012031131 is a deficient number, since it is larger than the sum of its proper divisors (1000388133).
31012031131 is a wasteful number, since it uses less digits than its factorization.
31012031131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1000388132.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 31012031131 its reverse (13113021013), we get a palindrome (44125052144).
The spelling of 31012031131 in words is "thirty-one billion, twelve million, thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •