Base | Representation |
---|---|
bin | 111101100000111001… |
… | …0110001101011010001 |
3 | 110121222022002011210211 |
4 | 1323001302301223101 |
5 | 4131020141112431 |
6 | 140404104324121 |
7 | 12354366203653 |
oct | 1730162615321 |
9 | 417868064724 |
10 | 132100332241 |
11 | 510292148a9 |
12 | 21728173641 |
13 | c5c307a987 |
14 | 65724006d3 |
15 | 36824442b1 |
hex | 1ec1cb1ad1 |
132100332241 has 2 divisors, whose sum is σ = 132100332242. Its totient is φ = 132100332240.
The previous prime is 132100332229. The next prime is 132100332253. The reversal of 132100332241 is 142233001231.
It is a balanced prime because it is at equal distance from previous prime (132100332229) and next prime (132100332253).
It can be written as a sum of positive squares in only one way, i.e., 91264410000 + 40835922241 = 302100^2 + 202079^2 .
It is a cyclic number.
It is not a de Polignac number, because 132100332241 - 217 = 132100201169 is a prime.
It is not a weakly prime, because it can be changed into another prime (132100332211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66050166120 + 66050166121.
It is an arithmetic number, because the mean of its divisors is an integer number (66050166121).
Almost surely, 2132100332241 is an apocalyptic number.
It is an amenable number.
132100332241 is a deficient number, since it is larger than the sum of its proper divisors (1).
132100332241 is an equidigital number, since it uses as much as digits as its factorization.
132100332241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 132100332241 its reverse (142233001231), we get a palindrome (274333333472).
The spelling of 132100332241 in words is "one hundred thirty-two billion, one hundred million, three hundred thirty-two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •