Base | Representation |
---|---|
bin | 111101100011111101… |
… | …0011101110011100101 |
3 | 110122020110021210222222 |
4 | 1323013322131303211 |
5 | 4131222432330201 |
6 | 140422213202125 |
7 | 12360054024554 |
oct | 1730772356345 |
9 | 418213253888 |
10 | 132203011301 |
11 | 51081176129 |
12 | 21756630345 |
13 | c60b41ba0a |
14 | 6581ccbd9b |
15 | 368b47791b |
hex | 1ec7e9dce5 |
132203011301 has 2 divisors, whose sum is σ = 132203011302. Its totient is φ = 132203011300.
The previous prime is 132203011271. The next prime is 132203011319. The reversal of 132203011301 is 103110302231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 95021145025 + 37181866276 = 308255^2 + 192826^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132203011301 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 132203011301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132203011321) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66101505650 + 66101505651.
It is an arithmetic number, because the mean of its divisors is an integer number (66101505651).
Almost surely, 2132203011301 is an apocalyptic number.
It is an amenable number.
132203011301 is a deficient number, since it is larger than the sum of its proper divisors (1).
132203011301 is an equidigital number, since it uses as much as digits as its factorization.
132203011301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 132203011301 its reverse (103110302231), we get a palindrome (235313313532).
It can be divided in two parts, 1322030 and 11301, that added together give a palindrome (1333331).
The spelling of 132203011301 in words is "one hundred thirty-two billion, two hundred three million, eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •