Base | Representation |
---|---|
bin | 100010001001110010010101… |
… | …1000111111100001010000111 |
3 | 1110101200010102111201001210121 |
4 | 1010103210223013330022013 |
5 | 303333423202010123143 |
6 | 2542531244201002411 |
7 | 120164031432361525 |
oct | 10423445307741207 |
9 | 1411603374631717 |
10 | 300412211020423 |
11 | 877a2115433237 |
12 | 29839a95783407 |
13 | cb81999820118 |
14 | 5428058667315 |
15 | 24ae6272ac7ed |
hex | 111392b1fc287 |
300412211020423 has 2 divisors, whose sum is σ = 300412211020424. Its totient is φ = 300412211020422.
The previous prime is 300412211020379. The next prime is 300412211020429. The reversal of 300412211020423 is 324020112214003.
It is a strong prime.
It is an emirp because it is prime and its reverse (324020112214003) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-300412211020423 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (300412211020429) 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, 150206105510211 + 150206105510212.
It is an arithmetic number, because the mean of its divisors is an integer number (150206105510212).
Almost surely, 2300412211020423 is an apocalyptic number.
300412211020423 is a deficient number, since it is larger than the sum of its proper divisors (1).
300412211020423 is an equidigital number, since it uses as much as digits as its factorization.
300412211020423 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 300412211020423 its reverse (324020112214003), we get a palindrome (624432323234426).
The spelling of 300412211020423 in words is "three hundred trillion, four hundred twelve billion, two hundred eleven million, twenty thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •