Base | Representation |
---|---|
bin | 11110000010101000100101… |
… | …011000001000100110001011 |
3 | 122022210210000222211102202001 |
4 | 132002220211120020212023 |
5 | 114304143144211340321 |
6 | 1145000110412251431 |
7 | 36554346341001451 |
oct | 3602504530104613 |
9 | 568723028742661 |
10 | 132122411043211 |
11 | 39109888678626 |
12 | 1299a260170b77 |
13 | 5895122687bb4 |
14 | 248aa8a28a9d1 |
15 | 1041c19034c91 |
hex | 782a2560898b |
132122411043211 has 2 divisors, whose sum is σ = 132122411043212. Its totient is φ = 132122411043210.
The previous prime is 132122411043199. The next prime is 132122411043221. The reversal of 132122411043211 is 112340114221231.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 132122411043211 - 25 = 132122411043179 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 132122411043211.
It is not a weakly prime, because it can be changed into another prime (132122411043221) 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, 66061205521605 + 66061205521606.
It is an arithmetic number, because the mean of its divisors is an integer number (66061205521606).
Almost surely, 2132122411043211 is an apocalyptic number.
132122411043211 is a deficient number, since it is larger than the sum of its proper divisors (1).
132122411043211 is an equidigital number, since it uses as much as digits as its factorization.
132122411043211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 28.
Adding to 132122411043211 its reverse (112340114221231), we get a palindrome (244462525264442).
The spelling of 132122411043211 in words is "one hundred thirty-two trillion, one hundred twenty-two billion, four hundred eleven million, forty-three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •