Base | Representation |
---|---|
bin | 111101100011111101… |
… | …1100100010111010101 |
3 | 110122020110211111102222 |
4 | 1323013323210113111 |
5 | 4131223021102214 |
6 | 140422223312125 |
7 | 12360056340263 |
oct | 1730773442725 |
9 | 418213744388 |
10 | 132203300309 |
11 | 51081353283 |
12 | 2175674b645 |
13 | c60b4c0422 |
14 | 6581d65433 |
15 | 368b4d338e |
hex | 1ec7ee45d5 |
132203300309 has 2 divisors, whose sum is σ = 132203300310. Its totient is φ = 132203300308.
The previous prime is 132203300233. The next prime is 132203300399. The reversal of 132203300309 is 903003302231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 76579492900 + 55623807409 = 276730^2 + 235847^2 .
It is an emirp because it is prime and its reverse (903003302231) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132203300309 is a prime.
It is a super-2 number, since 2×1322033003092 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132203300399) 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, 66101650154 + 66101650155.
It is an arithmetic number, because the mean of its divisors is an integer number (66101650155).
Almost surely, 2132203300309 is an apocalyptic number.
It is an amenable number.
132203300309 is a deficient number, since it is larger than the sum of its proper divisors (1).
132203300309 is an equidigital number, since it uses as much as digits as its factorization.
132203300309 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916, while the sum is 26.
The spelling of 132203300309 in words is "one hundred thirty-two billion, two hundred three million, three hundred thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •