Base | Representation |
---|---|
bin | 1110001111010001101001… |
… | …11101110101100000010011 |
3 | 11002212022200101012222120101 |
4 | 13013220310331311200103 |
5 | 13101000314223304021 |
6 | 150332100010153231 |
7 | 6411105505326055 |
oct | 707506475654023 |
9 | 132768611188511 |
10 | 31311200213011 |
11 | 9a8200726a034 |
12 | 36183a1722817 |
13 | 1461830a91264 |
14 | 7a36822418d5 |
15 | 39472213aa91 |
hex | 1c7a34f75813 |
31311200213011 has 16 divisors (see below), whose sum is σ = 32180938892928. Its totient is φ = 30450148518400.
The previous prime is 31311200212951. The next prime is 31311200213017. The reversal of 31311200213011 is 11031200211313.
It is a cyclic number.
It is not a de Polignac number, because 31311200213011 - 235 = 31276840474643 is a prime.
It is a super-2 number, since 2×313112002130112 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 31311200213011.
It is not an unprimeable number, because it can be changed into a prime (31311200213017) 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, 12874671 + ... + 15112231.
It is an arithmetic number, because the mean of its divisors is an integer number (2011308680808).
Almost surely, 231311200213011 is an apocalyptic number.
31311200213011 is a deficient number, since it is larger than the sum of its proper divisors (869738679917).
31311200213011 is a wasteful number, since it uses less digits than its factorization.
31311200213011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2239502.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 31311200213011 its reverse (11031200211313), we get a palindrome (42342400424324).
The spelling of 31311200213011 in words is "thirty-one trillion, three hundred eleven billion, two hundred million, two hundred thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •