Base | Representation |
---|---|
bin | 11110000001000001111101… |
… | …000100011000110011000001 |
3 | 122022102020121002222111210102 |
4 | 132001001331010120303001 |
5 | 114300342003024041001 |
6 | 1144433323512212145 |
7 | 36543365464021205 |
oct | 3601017504306301 |
9 | 568366532874712 |
10 | 132012213112001 |
11 | 39077079828902 |
12 | 12980a2709a055 |
13 | 5887910179541 |
14 | 24855d4aa2b05 |
15 | 103de19890e6b |
hex | 78107d118cc1 |
132012213112001 has 2 divisors, whose sum is σ = 132012213112002. Its totient is φ = 132012213112000.
The previous prime is 132012213111991. The next prime is 132012213112009. The reversal of 132012213112001 is 100211312210231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 96835440250000 + 35176772862001 = 9840500^2 + 5931001^2 .
It is a cyclic number.
It is not a de Polignac number, because 132012213112001 - 210 = 132012213110977 is a prime.
It is not a weakly prime, because it can be changed into another prime (132012213112009) 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, 66006106556000 + 66006106556001.
It is an arithmetic number, because the mean of its divisors is an integer number (66006106556001).
Almost surely, 2132012213112001 is an apocalyptic number.
It is an amenable number.
132012213112001 is a deficient number, since it is larger than the sum of its proper divisors (1).
132012213112001 is an equidigital number, since it uses as much as digits as its factorization.
132012213112001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 132012213112001 its reverse (100211312210231), we get a palindrome (232223525322232).
The spelling of 132012213112001 in words is "one hundred thirty-two trillion, twelve billion, two hundred thirteen million, one hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •