Base | Representation |
---|---|
bin | 1110001111000010011001… |
… | …11011000011101011000001 |
3 | 11002211112112202000222200210 |
4 | 13013201030323003223001 |
5 | 13100332032111000301 |
6 | 150324223312504333 |
7 | 6410365552360254 |
oct | 707411473035301 |
9 | 132745482028623 |
10 | 31303012203201 |
11 | 9a79595359082 |
12 | 361689754b0a9 |
13 | 1460b2760153b |
14 | 7a31069d709b |
15 | 3943e33a3ad6 |
hex | 1c784cec3ac1 |
31303012203201 has 16 divisors (see below), whose sum is σ = 41816739182400. Its totient is φ = 20829016353600.
The previous prime is 31303012203161. The next prime is 31303012203241. The reversal of 31303012203201 is 10230221030313.
It is an interprime number because it is at equal distance from previous prime (31303012203161) and next prime (31303012203241).
It is not a de Polignac number, because 31303012203201 - 227 = 31302877985473 is a prime.
It is a super-2 number, since 2×313030122032012 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (31303012203241) 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, 1095126 + ... + 7987823.
It is an arithmetic number, because the mean of its divisors is an integer number (2613546198900).
Almost surely, 231303012203201 is an apocalyptic number.
It is an amenable number.
31303012203201 is a deficient number, since it is larger than the sum of its proper divisors (10513726979199).
31303012203201 is a wasteful number, since it uses less digits than its factorization.
31303012203201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9085136.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 31303012203201 its reverse (10230221030313), we get a palindrome (41533233233514).
The spelling of 31303012203201 in words is "thirty-one trillion, three hundred three billion, twelve million, two hundred three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •