Base | Representation |
---|---|
bin | 1110000111001000001100… |
… | …10010011100101100010101 |
3 | 11001212120001202121122201201 |
4 | 13003210012102130230111 |
5 | 13031403442004304023 |
6 | 145555320133352501 |
7 | 6351635105515252 |
oct | 703440622345425 |
9 | 131776052548651 |
10 | 31031244213013 |
11 | 99843054146a0 |
12 | 3592090a98731 |
13 | 14413067a46a5 |
14 | 793cc519a429 |
15 | 38c2d94d9bad |
hex | 1c390649cb15 |
31031244213013 has 64 divisors (see below), whose sum is σ = 35933846538240. Its totient is φ = 26538372000000.
The previous prime is 31031244213007. The next prime is 31031244213019.
31031244213013 is nontrivially palindromic in base 10.
It is an interprime number because it is at equal distance from previous prime (31031244213007) and next prime (31031244213019).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31031244213013 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31031244213019) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 520532578 + ... + 520592188.
It is an arithmetic number, because the mean of its divisors is an integer number (561466352160).
Almost surely, 231031244213013 is an apocalyptic number.
It is an amenable number.
31031244213013 is a deficient number, since it is larger than the sum of its proper divisors (4902602325227).
31031244213013 is a wasteful number, since it uses less digits than its factorization.
31031244213013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 60010.
The product of its (nonzero) digits is 5184, while the sum is 28.
It can be divided in two parts, 3103124 and 4213013, that added together give a palindrome (7316137).
The spelling of 31031244213013 in words is "thirty-one trillion, thirty-one billion, two hundred forty-four million, two hundred thirteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •