Base | Representation |
---|---|
bin | 11110000010010101101101… |
… | …010000010111111100100001 |
3 | 122022201211201102022001122212 |
4 | 132002111231100113330201 |
5 | 114303330141341211001 |
6 | 1144542515235211505 |
7 | 36553031142050036 |
oct | 3602255520277441 |
9 | 568654642261585 |
10 | 132102142132001 |
11 | 39101227379638 |
12 | 12996344146b95 |
13 | 5893242378c02 |
14 | 2489ac63a538d |
15 | 104142e89b7bb |
hex | 78256d417f21 |
132102142132001 has 2 divisors, whose sum is σ = 132102142132002. Its totient is φ = 132102142132000.
The previous prime is 132102142131931. The next prime is 132102142132019. The reversal of 132102142132001 is 100231241201231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 130763250150976 + 1338891981025 = 11435176^2 + 1157105^2 .
It is a cyclic number.
It is not a de Polignac number, because 132102142132001 - 218 = 132102141869857 is a prime.
It is not a weakly prime, because it can be changed into another prime (132102142132061) 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, 66051071066000 + 66051071066001.
It is an arithmetic number, because the mean of its divisors is an integer number (66051071066001).
Almost surely, 2132102142132001 is an apocalyptic number.
It is an amenable number.
132102142132001 is a deficient number, since it is larger than the sum of its proper divisors (1).
132102142132001 is an equidigital number, since it uses as much as digits as its factorization.
132102142132001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 132102142132001 its reverse (100231241201231), we get a palindrome (232333383333232).
The spelling of 132102142132001 in words is "one hundred thirty-two trillion, one hundred two billion, one hundred forty-two million, one hundred thirty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •