Base | Representation |
---|---|
bin | 101101110001110000011010… |
… | …100101111111001110001101 |
3 | 222101212002100202210121010021 |
4 | 231301300122211333032031 |
5 | 202342103032240230242 |
6 | 1552110200530542141 |
7 | 60256465056243601 |
oct | 5561603245771615 |
9 | 871762322717107 |
10 | 201331333133197 |
11 | 59172158947243 |
12 | 1a6b7440137951 |
13 | 88456039b7507 |
14 | 37a06ba6c1501 |
15 | 1842153b75b67 |
hex | b71c1a97f38d |
201331333133197 has 2 divisors, whose sum is σ = 201331333133198. Its totient is φ = 201331333133196.
The previous prime is 201331333133113. The next prime is 201331333133221. The reversal of 201331333133197 is 791331333133102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 128503218277476 + 72828114855721 = 11335926^2 + 8533939^2 .
It is a cyclic number.
It is not a de Polignac number, because 201331333133197 - 219 = 201331332608909 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201331333133797) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100665666566598 + 100665666566599.
It is an arithmetic number, because the mean of its divisors is an integer number (100665666566599).
Almost surely, 2201331333133197 is an apocalyptic number.
It is an amenable number.
201331333133197 is a deficient number, since it is larger than the sum of its proper divisors (1).
201331333133197 is an equidigital number, since it uses as much as digits as its factorization.
201331333133197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 275562, while the sum is 43.
Adding to 201331333133197 its reverse (791331333133102), we get a palindrome (992662666266299).
The spelling of 201331333133197 in words is "two hundred one trillion, three hundred thirty-one billion, three hundred thirty-three million, one hundred thirty-three thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •