Base | Representation |
---|---|
bin | 1110001010000110010011… |
… | …11101100111001011111001 |
3 | 11002020022111222220120200010 |
4 | 13011003021331213023321 |
5 | 13040042010200124423 |
6 | 150114240142132133 |
7 | 6362210322646053 |
oct | 705031175471371 |
9 | 132208458816603 |
10 | 31133311333113 |
11 | 9a13621670710 |
12 | 35a9a16b81049 |
13 | 144ab2162c202 |
14 | 798c089888d3 |
15 | 38ecaee44693 |
hex | 1c50c9f672f9 |
31133311333113 has 16 divisors (see below), whose sum is σ = 47948629219776. Its totient is φ = 17758751562240.
The previous prime is 31133311333087. The next prime is 31133311333169.
31133311333113 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 31133311333113 - 28 = 31133311332857 is a prime.
It is a nude number because it is divisible by every one of its digits.
It is not an unprimeable number, because it can be changed into a prime (31133311333193) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 27748048756 + ... + 27748049877.
It is an arithmetic number, because the mean of its divisors is an integer number (2996789326236).
Almost surely, 231133311333113 is an apocalyptic number.
31133311333113 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
It is an amenable number.
31133311333113 is a deficient number, since it is larger than the sum of its proper divisors (16815317886663).
31133311333113 is a wasteful number, since it uses less digits than its factorization.
31133311333113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55496098664.
The product of its digits is 6561, while the sum is 30.
It can be divided in two parts, 3113331 and 1333113, that added together give a palindrome (4446444).
The spelling of 31133311333113 in words is "thirty-one trillion, one hundred thirty-three billion, three hundred eleven million, three hundred thirty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •