Base | Representation |
---|---|
bin | 1110000110111001000101… |
… | …01001111100110011011111 |
3 | 11001211210010021200011011210 |
4 | 13003130202221330303133 |
5 | 13031240332312420221 |
6 | 145551455042115503 |
7 | 6351230041534413 |
oct | 703344251746337 |
9 | 131753107604153 |
10 | 31023130201311 |
11 | 99809212555a6 |
12 | 35905a764bb93 |
13 | 1440612753231 |
14 | 7937556d4d43 |
15 | 38beb1ebd276 |
hex | 1c3722a7ccdf |
31023130201311 has 4 divisors (see below), whose sum is σ = 41364173601752. Its totient is φ = 20682086800872.
The previous prime is 31023130201243. The next prime is 31023130201319. The reversal of 31023130201311 is 11310203132013.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 31023130201311 - 215 = 31023130168543 is a prime.
It is a super-2 number, since 2×310231302013112 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31023130201319) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5170521700216 + ... + 5170521700221.
It is an arithmetic number, because the mean of its divisors is an integer number (10341043400438).
Almost surely, 231023130201311 is an apocalyptic number.
31023130201311 is a deficient number, since it is larger than the sum of its proper divisors (10341043400441).
31023130201311 is a wasteful number, since it uses less digits than its factorization.
31023130201311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10341043400440.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 31023130201311 its reverse (11310203132013), we get a palindrome (42333333333324).
The spelling of 31023130201311 in words is "thirty-one trillion, twenty-three billion, one hundred thirty million, two hundred one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •