Base | Representation |
---|---|
bin | 11110000001001001011011… |
… | …110000101000100101100101 |
3 | 122022110000022210221002012111 |
4 | 132001021123300220211211 |
5 | 114301004430010022021 |
6 | 1144441132442521021 |
7 | 36544101503224045 |
oct | 3601113360504545 |
9 | 568400283832174 |
10 | 132020244220261 |
11 | 3907a520113361 |
12 | 129824a8806171 |
13 | 58885bcc91bc7 |
14 | 2485b57547725 |
15 | 103e2399838e1 |
hex | 78125bc28965 |
132020244220261 has 2 divisors, whose sum is σ = 132020244220262. Its totient is φ = 132020244220260.
The previous prime is 132020244220247. The next prime is 132020244220339. The reversal of 132020244220261 is 162022442020231.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 131902238916900 + 118005303361 = 11484870^2 + 343519^2 .
It is a cyclic number.
It is not a de Polignac number, because 132020244220261 - 27 = 132020244220133 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132020244220861) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66010122110130 + 66010122110131.
It is an arithmetic number, because the mean of its divisors is an integer number (66010122110131).
Almost surely, 2132020244220261 is an apocalyptic number.
It is an amenable number.
132020244220261 is a deficient number, since it is larger than the sum of its proper divisors (1).
132020244220261 is an equidigital number, since it uses as much as digits as its factorization.
132020244220261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18432, while the sum is 31.
Adding to 132020244220261 its reverse (162022442020231), we get a palindrome (294042686240492).
The spelling of 132020244220261 in words is "one hundred thirty-two trillion, twenty billion, two hundred forty-four million, two hundred twenty thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •