Base | Representation |
---|---|
bin | 1110001010000010001101… |
… | …10100011100000110011001 |
3 | 11002020002211122210211020111 |
4 | 13011001012310130012121 |
5 | 13040023003421104423 |
6 | 150113233543524321 |
7 | 6362101645252354 |
oct | 705010664340631 |
9 | 132202748724214 |
10 | 31131111113113 |
11 | 9a126a2700880 |
12 | 35a95021596a1 |
13 | 144a86085169b |
14 | 798a7a69129b |
15 | 38ebd1bd260d |
hex | 1c5046d1c199 |
31131111113113 has 16 divisors (see below), whose sum is σ = 34201958630400. Its totient is φ = 28100972077200.
The previous prime is 31131111113107. The next prime is 31131111113117.
31131111113113 is nontrivially palindromic in base 10.
It is a de Polignac number, because none of the positive numbers 2k-31131111113113 is a prime.
It is not an unprimeable number, because it can be changed into a prime (31131111113117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13535203 + ... + 15667288.
It is an arithmetic number, because the mean of its divisors is an integer number (2137622414400).
Almost surely, 231131111113113 is an apocalyptic number.
It is an amenable number.
31131111113113 is a deficient number, since it is larger than the sum of its proper divisors (3070847517287).
31131111113113 is a wasteful number, since it uses less digits than its factorization.
31131111113113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29203188.
The product of its digits is 81, while the sum is 22.
Multiplying 31131111113113 by its sum of digits (22), we get a palindrome (684884444488486).
It can be divided in two parts, 3113111 and 1113113, that added together give a palindrome (4226224).
The spelling of 31131111113113 in words is "thirty-one trillion, one hundred thirty-one billion, one hundred eleven million, one hundred thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •