Base | Representation |
---|---|
bin | 100010001000010001000000… |
… | …1110000111001101100101011 |
3 | 1110100221010221221200012102212 |
4 | 1010100202001300321230223 |
5 | 303322012134031420243 |
6 | 2542251241253315335 |
7 | 120142652300256053 |
oct | 10420420160715453 |
9 | 1410833857605385 |
10 | 300203211201323 |
11 | 87721515494811 |
12 | 29805488035b4b |
13 | cb6806cab5101 |
14 | 541bcad1ba563 |
15 | 24a8e93b95318 |
hex | 1110881c39b2b |
300203211201323 has 2 divisors, whose sum is σ = 300203211201324. Its totient is φ = 300203211201322.
The previous prime is 300203211201253. The next prime is 300203211201337. The reversal of 300203211201323 is 323102112302003.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 300203211201323 - 228 = 300202942765867 is a prime.
It is a super-2 number, since 2×3002032112013232 (a number of 30 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (300203211291323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 150101605600661 + 150101605600662.
It is an arithmetic number, because the mean of its divisors is an integer number (150101605600662).
Almost surely, 2300203211201323 is an apocalyptic number.
300203211201323 is a deficient number, since it is larger than the sum of its proper divisors (1).
300203211201323 is an equidigital number, since it uses as much as digits as its factorization.
300203211201323 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 300203211201323 its reverse (323102112302003), we get a palindrome (623305323503326).
The spelling of 300203211201323 in words is "three hundred trillion, two hundred three billion, two hundred eleven million, two hundred one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •