Base | Representation |
---|---|
bin | 1110001111001111110100… |
… | …00000110010001010001111 |
3 | 11002212020010110002100202020 |
4 | 13013213322000302022033 |
5 | 13100441303022124444 |
6 | 150331413514501223 |
7 | 6411042135264114 |
oct | 707477200621217 |
9 | 132766113070666 |
10 | 31310211129999 |
11 | 9a81649a2235a |
12 | 3618166434813 |
13 | 1461703ba7139 |
14 | 7a35cab3690b |
15 | 3946b53b4119 |
hex | 1c79fa03228f |
31310211129999 has 8 divisors (see below), whose sum is σ = 41748786607920. Its totient is φ = 20872554869376.
The previous prime is 31310211129997. The next prime is 31310211130007. The reversal of 31310211129999 is 99992111201313.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 31310211129999 - 21 = 31310211129997 is a prime.
It is a super-2 number, since 2×313102111299992 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31310211129997) 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 7 ways as a sum of consecutive naturals, for example, 229724842 + ... + 229861095.
It is an arithmetic number, because the mean of its divisors is an integer number (5218598325990).
Almost surely, 231310211129999 is an apocalyptic number.
31310211129999 is a deficient number, since it is larger than the sum of its proper divisors (10438575477921).
31310211129999 is a wasteful number, since it uses less digits than its factorization.
31310211129999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 459608649.
The product of its (nonzero) digits is 236196, while the sum is 51.
The spelling of 31310211129999 in words is "thirty-one trillion, three hundred ten billion, two hundred eleven million, one hundred twenty-nine thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •