Base | Representation |
---|---|
bin | 11110000010010111110000… |
… | …100001000001110111101001 |
3 | 122022202001101220002110111222 |
4 | 132002113300201001313221 |
5 | 114303344144121011241 |
6 | 1144543521543431425 |
7 | 36553136542222532 |
oct | 3602276041016751 |
9 | 568661356073458 |
10 | 132104344313321 |
11 | 39102157458aa6 |
12 | 12996859755575 |
13 | 5893503692393 |
14 | 2489c54a4d689 |
15 | 104150cd99a4b |
hex | 7825f0841de9 |
132104344313321 has 2 divisors, whose sum is σ = 132104344313322. Its totient is φ = 132104344313320.
The previous prime is 132104344313287. The next prime is 132104344313341. The reversal of 132104344313321 is 123313443401231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 130669224172096 + 1435120141225 = 11431064^2 + 1197965^2 .
It is a cyclic number.
It is not a de Polignac number, because 132104344313321 - 226 = 132104277204457 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (132104344313341) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66052172156660 + 66052172156661.
It is an arithmetic number, because the mean of its divisors is an integer number (66052172156661).
Almost surely, 2132104344313321 is an apocalyptic number.
It is an amenable number.
132104344313321 is a deficient number, since it is larger than the sum of its proper divisors (1).
132104344313321 is an equidigital number, since it uses as much as digits as its factorization.
132104344313321 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 62208, while the sum is 35.
Adding to 132104344313321 its reverse (123313443401231), we get a palindrome (255417787714552).
The spelling of 132104344313321 in words is "one hundred thirty-two trillion, one hundred four billion, three hundred forty-four million, three hundred thirteen thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •