Base | Representation |
---|---|
bin | 11100111001100101… |
… | …111010101010111111 |
3 | 2222002121022201222220 |
4 | 130321211322222333 |
5 | 1002022414341111 |
6 | 22131102140423 |
7 | 2145656151555 |
oct | 347145725277 |
9 | 88077281886 |
10 | 31031012031 |
11 | 12184219698 |
12 | 6020281713 |
13 | 2c06b6caa6 |
14 | 1705349bd5 |
15 | c193d3e06 |
hex | 73997aabf |
31031012031 has 4 divisors (see below), whose sum is σ = 41374682712. Its totient is φ = 20687341352.
The previous prime is 31031012009. The next prime is 31031012039. The reversal of 31031012031 is 13021013013.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 31031012031 - 26 = 31031011967 is a prime.
It is a super-2 number, since 2×310310120312 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 31031012031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31031012039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5171835336 + ... + 5171835341.
It is an arithmetic number, because the mean of its divisors is an integer number (10343670678).
Almost surely, 231031012031 is an apocalyptic number.
31031012031 is a deficient number, since it is larger than the sum of its proper divisors (10343670681).
31031012031 is a wasteful number, since it uses less digits than its factorization.
31031012031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10343670680.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 31031012031 its reverse (13021013013), we get a palindrome (44052025044).
The spelling of 31031012031 in words is "thirty-one billion, thirty-one million, twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •