Base | Representation |
---|---|
bin | 100010000110111000000100… |
… | …1111000010011000000000111 |
3 | 1110100020212222112111121121111 |
4 | 1010031300021320103000013 |
5 | 303310400012124004111 |
6 | 2542023413425225451 |
7 | 120123111344066233 |
oct | 10415601170230007 |
9 | 1410225875447544 |
10 | 300012221313031 |
11 | 876585176a0927 |
12 | 29794465a92287 |
13 | cb530533768a6 |
14 | 54129519c35c3 |
15 | 24a4016748a21 |
hex | 110dc09e13007 |
300012221313031 has 2 divisors, whose sum is σ = 300012221313032. Its totient is φ = 300012221313030.
The previous prime is 300012221313011. The next prime is 300012221313037. The reversal of 300012221313031 is 130313122210003.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 300012221313031 - 221 = 300012219215879 is a prime.
It is a super-2 number, since 2×3000122213130312 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 300012221312993 and 300012221313011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (300012221313037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 150006110656515 + 150006110656516.
It is an arithmetic number, because the mean of its divisors is an integer number (150006110656516).
Almost surely, 2300012221313031 is an apocalyptic number.
300012221313031 is a deficient number, since it is larger than the sum of its proper divisors (1).
300012221313031 is an equidigital number, since it uses as much as digits as its factorization.
300012221313031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 300012221313031 its reverse (130313122210003), we get a palindrome (430325343523034).
The spelling of 300012221313031 in words is "three hundred trillion, twelve billion, two hundred twenty-one million, three hundred thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •