Base | Representation |
---|---|
bin | 111101100011111001… |
… | …0110111101110001001 |
3 | 110122020022112122212002 |
4 | 1323013302313232021 |
5 | 4131221430122142 |
6 | 140422102400345 |
7 | 12360031063103 |
oct | 1730762675611 |
9 | 418208478762 |
10 | 132201020297 |
11 | 51080036275 |
12 | 21755a300b5 |
13 | c60aba26c8 |
14 | 6581930573 |
15 | 368b1d2a32 |
hex | 1ec7cb7b89 |
132201020297 has 2 divisors, whose sum is σ = 132201020298. Its totient is φ = 132201020296.
The previous prime is 132201020279. The next prime is 132201020321. The reversal of 132201020297 is 792020102231.
Together with previous prime (132201020279) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 130336162441 + 1864857856 = 361021^2 + 43184^2 .
It is an emirp because it is prime and its reverse (792020102231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 132201020297 - 228 = 131932584841 is a prime.
It is not a weakly prime, because it can be changed into another prime (132201020267) 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, 66100510148 + 66100510149.
It is an arithmetic number, because the mean of its divisors is an integer number (66100510149).
Almost surely, 2132201020297 is an apocalyptic number.
It is an amenable number.
132201020297 is a deficient number, since it is larger than the sum of its proper divisors (1).
132201020297 is an equidigital number, since it uses as much as digits as its factorization.
132201020297 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3024, while the sum is 29.
The spelling of 132201020297 in words is "one hundred thirty-two billion, two hundred one million, twenty thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •