Base | Representation |
---|---|
bin | 1011101101111001101… |
… | …1000100010111111001 |
3 | 201020120221201022012011 |
4 | 2323132123010113321 |
5 | 11244230313231434 |
6 | 232250452245521 |
7 | 20354255621206 |
oct | 2733633042771 |
9 | 636527638164 |
10 | 201300133369 |
11 | 7840974a695 |
12 | 3301b0108a1 |
13 | 15ca07a2a6a |
14 | 9a58a38cad |
15 | 538268de64 |
hex | 2ede6c45f9 |
201300133369 has 2 divisors, whose sum is σ = 201300133370. Its totient is φ = 201300133368.
The previous prime is 201300133259. The next prime is 201300133387. The reversal of 201300133369 is 963331003102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 113846857744 + 87453275625 = 337412^2 + 295725^2 .
It is a cyclic number.
It is not a de Polignac number, because 201300133369 - 27 = 201300133241 is a prime.
It is a super-2 number, since 2×2013001333692 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 201300133369.
It is not a weakly prime, because it can be changed into another prime (201300133469) 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, 100650066684 + 100650066685.
It is an arithmetic number, because the mean of its divisors is an integer number (100650066685).
Almost surely, 2201300133369 is an apocalyptic number.
It is an amenable number.
201300133369 is a deficient number, since it is larger than the sum of its proper divisors (1).
201300133369 is an equidigital number, since it uses as much as digits as its factorization.
201300133369 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8748, while the sum is 31.
The spelling of 201300133369 in words is "two hundred one billion, three hundred million, one hundred thirty-three thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •