Base | Representation |
---|---|
bin | 100010000110111100010000… |
… | …1101010010011000011110111 |
3 | 1110100021202011222201221222101 |
4 | 1010031320201222103003313 |
5 | 303311021414304343111 |
6 | 2542031501413042531 |
7 | 120123550163453242 |
oct | 10415704152230367 |
9 | 1410252158657871 |
10 | 300021210231031 |
11 | 8766130a702a83 |
12 | 29796154326447 |
13 | cb53b56746993 |
14 | 5413165752259 |
15 | 24a4390986bc1 |
hex | 110de21a930f7 |
300021210231031 has 2 divisors, whose sum is σ = 300021210231032. Its totient is φ = 300021210231030.
The previous prime is 300021210230971. The next prime is 300021210231047. The reversal of 300021210231031 is 130132012120003.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 300021210231031 - 211 = 300021210228983 is a prime.
It is a super-2 number, since 2×3000212102310312 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (300021210031031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 150010605115515 + 150010605115516.
It is an arithmetic number, because the mean of its divisors is an integer number (150010605115516).
Almost surely, 2300021210231031 is an apocalyptic number.
300021210231031 is a deficient number, since it is larger than the sum of its proper divisors (1).
300021210231031 is an equidigital number, since it uses as much as digits as its factorization.
300021210231031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 300021210231031 its reverse (130132012120003), we get a palindrome (430153222351034).
The spelling of 300021210231031 in words is "three hundred trillion, twenty-one billion, two hundred ten million, two hundred thirty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •