Base | Representation |
---|---|
bin | 11110000101100001100100… |
… | …101101100010010111011011 |
3 | 122100111202201221020022101222 |
4 | 132011201210231202113123 |
5 | 114320421443240122021 |
6 | 1145231240401402255 |
7 | 36604610530151312 |
oct | 3605414455422733 |
9 | 570452657208358 |
10 | 132321042114011 |
11 | 39186047741a83 |
12 | 12a1085533938b |
13 | 58aaa891b6a9a |
14 | 2496530627279 |
15 | 1046e922006ab |
hex | 785864b625db |
132321042114011 has 2 divisors, whose sum is σ = 132321042114012. Its totient is φ = 132321042114010.
The previous prime is 132321042113993. The next prime is 132321042114029. The reversal of 132321042114011 is 110411240123231.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (132321042113993) and next prime (132321042114029).
It is a cyclic number.
It is not a de Polignac number, because 132321042114011 - 214 = 132321042097627 is a prime.
It is a super-2 number, since 2×1323210421140112 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (132321042114031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66160521057005 + 66160521057006.
It is an arithmetic number, because the mean of its divisors is an integer number (66160521057006).
Almost surely, 2132321042114011 is an apocalyptic number.
132321042114011 is a deficient number, since it is larger than the sum of its proper divisors (1).
132321042114011 is an equidigital number, since it uses as much as digits as its factorization.
132321042114011 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1152, while the sum is 26.
Adding to 132321042114011 its reverse (110411240123231), we get a palindrome (242732282237242).
The spelling of 132321042114011 in words is "one hundred thirty-two trillion, three hundred twenty-one billion, forty-two million, one hundred fourteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •