Base | Representation |
---|---|
bin | 1001001110110100000100… |
… | …11001101110000000010101 |
3 | 2122212200101001210020020001 |
4 | 10213122002121232000111 |
5 | 10130044304011033023 |
6 | 111101441251011301 |
7 | 4163432650215322 |
oct | 447320231560025 |
9 | 78780331706201 |
10 | 20300203221013 |
11 | 65172a4547291 |
12 | 233a394b99b31 |
13 | b433bb256a61 |
14 | 50276c37db49 |
15 | 2530c52d86ad |
hex | 12768266e015 |
20300203221013 has 2 divisors, whose sum is σ = 20300203221014. Its totient is φ = 20300203221012.
The previous prime is 20300203220923. The next prime is 20300203221019. The reversal of 20300203221013 is 31012230200302.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20061862028209 + 238341192804 = 4479047^2 + 488202^2 .
It is a cyclic number.
It is not a de Polignac number, because 20300203221013 - 233 = 20291613286421 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20300203221019) 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, 10150101610506 + 10150101610507.
It is an arithmetic number, because the mean of its divisors is an integer number (10150101610507).
Almost surely, 220300203221013 is an apocalyptic number.
It is an amenable number.
20300203221013 is a deficient number, since it is larger than the sum of its proper divisors (1).
20300203221013 is an equidigital number, since it uses as much as digits as its factorization.
20300203221013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 20300203221013 its reverse (31012230200302), we get a palindrome (51312433421315).
The spelling of 20300203221013 in words is "twenty trillion, three hundred billion, two hundred three million, two hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •