Base | Representation |
---|---|
bin | 1110001010000100000100… |
… | …11011001011001010101001 |
3 | 11002020012102100111121001220 |
4 | 13011002002123023022221 |
5 | 13040032030421414423 |
6 | 150113521105332253 |
7 | 6362135510224410 |
oct | 705020233131251 |
9 | 132205370447056 |
10 | 31132111123113 |
11 | 9a13066131120 |
12 | 35a9741037089 |
13 | 144a98ca93290 |
14 | 798b33402477 |
15 | 38ec3e8b69e3 |
hex | 1c50826cb2a9 |
31132111123113 has 128 divisors (see below), whose sum is σ = 58167520395264. Its totient is φ = 14276636985600.
The previous prime is 31132111123007. The next prime is 31132111123129.
31132111123113 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 31132111123113 - 29 = 31132111122601 is a prime.
It is not an unprimeable number, because it can be changed into a prime (31132111123153) 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 127 ways as a sum of consecutive naturals, for example, 377835306 + ... + 377917692.
It is an arithmetic number, because the mean of its divisors is an integer number (454433753088).
Almost surely, 231132111123113 is an apocalyptic number.
31132111123113 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
It is an amenable number.
31132111123113 is a deficient number, since it is larger than the sum of its proper divisors (27035409272151).
31132111123113 is a wasteful number, since it uses less digits than its factorization.
31132111123113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87915.
The product of its digits is 324, while the sum is 24.
It can be divided in two parts, 3113211 and 1123113, that added together give a palindrome (4236324).
The spelling of 31132111123113 in words is "thirty-one trillion, one hundred thirty-two billion, one hundred eleven million, one hundred twenty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •