Base | Representation |
---|---|
bin | 11110000010010111110000… |
… | …010101001101000001111101 |
3 | 122022202001101200020222002201 |
4 | 132002113300111031001331 |
5 | 114303344142322311214 |
6 | 1144543521353151501 |
7 | 36553136503661563 |
oct | 3602276025150175 |
9 | 568661350228081 |
10 | 132104341213309 |
11 | 39102155730a03 |
12 | 129968586bb591 |
13 | 5893502b4835a |
14 | 2489c54483a33 |
15 | 104150c986274 |
hex | 7825f054d07d |
132104341213309 has 2 divisors, whose sum is σ = 132104341213310. Its totient is φ = 132104341213308.
The previous prime is 132104341213237. The next prime is 132104341213331. The reversal of 132104341213309 is 903312143401231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 126589006387684 + 5515334825625 = 11251178^2 + 2348475^2 .
It is a cyclic number.
It is not a de Polignac number, because 132104341213309 - 233 = 132095751278717 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132104341213109) 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, 66052170606654 + 66052170606655.
It is an arithmetic number, because the mean of its divisors is an integer number (66052170606655).
Almost surely, 2132104341213309 is an apocalyptic number.
It is an amenable number.
132104341213309 is a deficient number, since it is larger than the sum of its proper divisors (1).
132104341213309 is an equidigital number, since it uses as much as digits as its factorization.
132104341213309 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46656, while the sum is 37.
The spelling of 132104341213309 in words is "one hundred thirty-two trillion, one hundred four billion, three hundred forty-one million, two hundred thirteen thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •