Base | Representation |
---|---|
bin | 11110000111010000110110… |
… | …110100010110000101111101 |
3 | 122100221012011100002101022011 |
4 | 132013100312310112011331 |
5 | 114324401201443343401 |
6 | 1145402201244051221 |
7 | 36616340553662212 |
oct | 3607206664260575 |
9 | 570835140071264 |
10 | 132440531231101 |
11 | 39221794187215 |
12 | 12a2ba41b33b11 |
13 | 58b911c5a8672 |
14 | 249c227b83b09 |
15 | 104a1373dd451 |
hex | 787436d1617d |
132440531231101 has 2 divisors, whose sum is σ = 132440531231102. Its totient is φ = 132440531231100.
The previous prime is 132440531231053. The next prime is 132440531231117. The reversal of 132440531231101 is 101132135044231.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 131074426103076 + 1366105128025 = 11448774^2 + 1168805^2 .
It is a cyclic number.
It is not a de Polignac number, because 132440531231101 - 211 = 132440531229053 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132440531231191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66220265615550 + 66220265615551.
It is an arithmetic number, because the mean of its divisors is an integer number (66220265615551).
Almost surely, 2132440531231101 is an apocalyptic number.
It is an amenable number.
132440531231101 is a deficient number, since it is larger than the sum of its proper divisors (1).
132440531231101 is an equidigital number, since it uses as much as digits as its factorization.
132440531231101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8640, while the sum is 31.
Adding to 132440531231101 its reverse (101132135044231), we get a palindrome (233572666275332).
The spelling of 132440531231101 in words is "one hundred thirty-two trillion, four hundred forty billion, five hundred thirty-one million, two hundred thirty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •