Base | Representation |
---|---|
bin | 111101100111001011… |
… | …0110010111011000001 |
3 | 110122111222200100100122 |
4 | 1323032112302323001 |
5 | 4131433120213441 |
6 | 140441034030025 |
7 | 12362535542333 |
oct | 1731626627301 |
9 | 418458610318 |
10 | 132311101121 |
11 | 51127192661 |
12 | 21786878315 |
13 | c6279357a4 |
14 | 65923c7453 |
15 | 3695bc934b |
hex | 1ece5b2ec1 |
132311101121 has 2 divisors, whose sum is σ = 132311101122. Its totient is φ = 132311101120.
The previous prime is 132311101103. The next prime is 132311101123. The reversal of 132311101121 is 121101113231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 129322948225 + 2988152896 = 359615^2 + 54664^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132311101121 is a prime.
Together with 132311101123, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 132311101121.
It is not a weakly prime, because it can be changed into another prime (132311101123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66155550560 + 66155550561.
It is an arithmetic number, because the mean of its divisors is an integer number (66155550561).
Almost surely, 2132311101121 is an apocalyptic number.
It is an amenable number.
132311101121 is a deficient number, since it is larger than the sum of its proper divisors (1).
132311101121 is an equidigital number, since it uses as much as digits as its factorization.
132311101121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 132311101121 its reverse (121101113231), we get a palindrome (253412214352).
The spelling of 132311101121 in words is "one hundred thirty-two billion, three hundred eleven million, one hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •