Base | Representation |
---|---|
bin | 101011110101001111110… |
… | …000111011010010010111 |
3 | 101122221210010221021101021 |
4 | 223311033300323102113 |
5 | 343322300214102221 |
6 | 10223424441142011 |
7 | 430421621053060 |
oct | 53651760732227 |
9 | 11587703837337 |
10 | 3012110300311 |
11 | a61479814632 |
12 | 40792578a907 |
13 | 18b06b7a3688 |
14 | a5b03427567 |
15 | 53542a01041 |
hex | 2bd4fc3b497 |
3012110300311 has 16 divisors (see below), whose sum is σ = 3623759545600. Its totient is φ = 2445810614208.
The previous prime is 3012110300299. The next prime is 3012110300323. The reversal of 3012110300311 is 1130030112103.
It is an interprime number because it is at equal distance from previous prime (3012110300299) and next prime (3012110300323).
It is not a de Polignac number, because 3012110300311 - 29 = 3012110299799 is a prime.
It is a super-2 number, since 2×30121103003112 (a number of 26 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 (3012110300371) 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, 2411755 + ... + 3441043.
It is an arithmetic number, because the mean of its divisors is an integer number (226484971600).
Almost surely, 23012110300311 is an apocalyptic number.
3012110300311 is a deficient number, since it is larger than the sum of its proper divisors (611649245289).
3012110300311 is a wasteful number, since it uses less digits than its factorization.
3012110300311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1051318.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 3012110300311 its reverse (1130030112103), we get a palindrome (4142140412414).
The spelling of 3012110300311 in words is "three trillion, twelve billion, one hundred ten million, three hundred thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •