Base | Representation |
---|---|
bin | 1110001111000000100010… |
… | …01100011000000101100111 |
3 | 11002211102221220102101200022 |
4 | 13013200101030120011213 |
5 | 13100323004042012221 |
6 | 150323540034305355 |
7 | 6410331663621533 |
oct | 707402114300547 |
9 | 132742856371608 |
10 | 31302010110311 |
11 | 9a79120735936 |
12 | 3616657a2825b |
13 | 14609c7b10875 |
14 | 7a304d8a2bc3 |
15 | 39438540c4ab |
hex | 1c7811318167 |
31302010110311 has 16 divisors (see below), whose sum is σ = 32080031520768. Its totient is φ = 30528833340000.
The previous prime is 31302010110227. The next prime is 31302010110401. The reversal of 31302010110311 is 11301101020313.
It is a cyclic number.
It is not a de Polignac number, because 31302010110311 - 214 = 31302010093927 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 31302010110311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31302013110311) 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, 15310076 + ... + 17233758.
It is an arithmetic number, because the mean of its divisors is an integer number (2005001970048).
Almost surely, 231302010110311 is an apocalyptic number.
31302010110311 is a deficient number, since it is larger than the sum of its proper divisors (778021410457).
31302010110311 is a wasteful number, since it uses less digits than its factorization.
31302010110311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1924942.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 31302010110311 its reverse (11301101020313), we get a palindrome (42603111130624).
The spelling of 31302010110311 in words is "thirty-one trillion, three hundred two billion, ten million, one hundred ten thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •