Base | Representation |
---|---|
bin | 1001001001111101000101… |
… | …01111001101001100110001 |
3 | 2122021201102020210102110012 |
4 | 10210332202233031030301 |
5 | 10114330334423001202 |
6 | 110453030024344305 |
7 | 4145402335234535 |
oct | 444764257151461 |
9 | 78251366712405 |
10 | 20133242000177 |
11 | 6462507266959 |
12 | 2311b5a015095 |
13 | b30730a41167 |
14 | 4d8650125bc5 |
15 | 24daa2642152 |
hex | 124fa2bcd331 |
20133242000177 has 2 divisors, whose sum is σ = 20133242000178. Its totient is φ = 20133242000176.
The previous prime is 20133242000101. The next prime is 20133242000213. The reversal of 20133242000177 is 77100024233102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17084135823616 + 3049106176561 = 4133296^2 + 1746169^2 .
It is a cyclic number.
It is not a de Polignac number, because 20133242000177 - 28 = 20133241999921 is a prime.
It is not a weakly prime, because it can be changed into another prime (20133242000077) 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, 10066621000088 + 10066621000089.
It is an arithmetic number, because the mean of its divisors is an integer number (10066621000089).
Almost surely, 220133242000177 is an apocalyptic number.
It is an amenable number.
20133242000177 is a deficient number, since it is larger than the sum of its proper divisors (1).
20133242000177 is an equidigital number, since it uses as much as digits as its factorization.
20133242000177 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14112, while the sum is 32.
Adding to 20133242000177 its reverse (77100024233102), we get a palindrome (97233266233279).
The spelling of 20133242000177 in words is "twenty trillion, one hundred thirty-three billion, two hundred forty-two million, one hundred seventy-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •