Base | Representation |
---|---|
bin | 11110000010101010010110… |
… | …110100011111101010011101 |
3 | 122022210221221122011001112021 |
4 | 132002222112310133222131 |
5 | 114304211043430200013 |
6 | 1145001023321540141 |
7 | 36554444451306265 |
oct | 3602522664375235 |
9 | 568727848131467 |
10 | 132124314303133 |
11 | 3910a674a4aa09 |
12 | 1299a6b1644651 |
13 | 5895366a904b9 |
14 | 248abcad627a5 |
15 | 1041ccb188a8d |
hex | 782a96d1fa9d |
132124314303133 has 2 divisors, whose sum is σ = 132124314303134. Its totient is φ = 132124314303132.
The previous prime is 132124314303127. The next prime is 132124314303143. The reversal of 132124314303133 is 331303413421231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 72304036099684 + 59820278203449 = 8503178^2 + 7734357^2 .
It is a cyclic number.
It is not a de Polignac number, because 132124314303133 - 25 = 132124314303101 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132124314303143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66062157151566 + 66062157151567.
It is an arithmetic number, because the mean of its divisors is an integer number (66062157151567).
Almost surely, 2132124314303133 is an apocalyptic number.
It is an amenable number.
132124314303133 is a deficient number, since it is larger than the sum of its proper divisors (1).
132124314303133 is an equidigital number, since it uses as much as digits as its factorization.
132124314303133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 46656, while the sum is 34.
Adding to 132124314303133 its reverse (331303413421231), we get a palindrome (463427727724364).
The spelling of 132124314303133 in words is "one hundred thirty-two trillion, one hundred twenty-four billion, three hundred fourteen million, three hundred three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •