Base | Representation |
---|---|
bin | 11110001010011101010010… |
… | …000010010010001100100001 |
3 | 122101201011201200000020011222 |
4 | 132022131102002102030201 |
5 | 114342000220441431311 |
6 | 1150051102122144425 |
7 | 36641241145645445 |
oct | 3612352202221441 |
9 | 571634650006158 |
10 | 132660031202081 |
11 | 392a68921a0209 |
12 | 12a664a0052115 |
13 | 5903a3080a0b6 |
14 | 24a8acb988825 |
15 | 1050bd275badb |
hex | 78a752092321 |
132660031202081 has 2 divisors, whose sum is σ = 132660031202082. Its totient is φ = 132660031202080.
The previous prime is 132660031202063. The next prime is 132660031202107. The reversal of 132660031202081 is 180202130066231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 111895459144225 + 20764572057856 = 10578065^2 + 4556816^2 .
It is a cyclic number.
It is not a de Polignac number, because 132660031202081 - 214 = 132660031185697 is a prime.
It is a super-2 number, since 2×1326600312020812 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (132660030202081) 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, 66330015601040 + 66330015601041.
It is an arithmetic number, because the mean of its divisors is an integer number (66330015601041).
Almost surely, 2132660031202081 is an apocalyptic number.
It is an amenable number.
132660031202081 is a deficient number, since it is larger than the sum of its proper divisors (1).
132660031202081 is an equidigital number, since it uses as much as digits as its factorization.
132660031202081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20736, while the sum is 35.
The spelling of 132660031202081 in words is "one hundred thirty-two trillion, six hundred sixty billion, thirty-one million, two hundred two thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •