Base | Representation |
---|---|
bin | 11110000011111011001101… |
… | …100000101110000101000011 |
3 | 122100010021001001110222122002 |
4 | 132003323031200232011003 |
5 | 114312121344042241344 |
6 | 1145104542153334215 |
7 | 36563640036666122 |
oct | 3603731540560503 |
9 | 570107031428562 |
10 | 132211131212099 |
11 | 39143475917655 |
12 | 129b34a040736b |
13 | 58a05c12b4454 |
14 | 24910a51d7ab9 |
15 | 10441acd5744e |
hex | 783ecd82e143 |
132211131212099 has 2 divisors, whose sum is σ = 132211131212100. Its totient is φ = 132211131212098.
The previous prime is 132211131212047. The next prime is 132211131212137. The reversal of 132211131212099 is 990212131112231.
It is an a-pointer prime, because the next prime (132211131212137) can be obtained adding 132211131212099 to its sum of digits (38).
It is a strong prime.
It is an emirp because it is prime and its reverse (990212131112231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 132211131212099 - 220 = 132211130163523 is a prime.
It is not a weakly prime, because it can be changed into another prime (132211131232099) 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, 66105565606049 + 66105565606050.
It is an arithmetic number, because the mean of its divisors is an integer number (66105565606050).
Almost surely, 2132211131212099 is an apocalyptic number.
132211131212099 is a deficient number, since it is larger than the sum of its proper divisors (1).
132211131212099 is an equidigital number, since it uses as much as digits as its factorization.
132211131212099 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 38.
The spelling of 132211131212099 in words is "one hundred thirty-two trillion, two hundred eleven billion, one hundred thirty-one million, two hundred twelve thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •