Base | Representation |
---|---|
bin | 11110001111101101000001… |
… | …110100110111000101101101 |
3 | 122102222122020220022212220212 |
4 | 132033231001310313011231 |
5 | 114413402024321004324 |
6 | 1150524442453552205 |
7 | 40006262620301243 |
oct | 3617550164670555 |
9 | 572878226285825 |
10 | 133020536500589 |
11 | 3942576901a841 |
12 | 12b04330645665 |
13 | 592ba2398488a |
14 | 24bc32a714793 |
15 | 105a281bd170e |
hex | 78fb41d3716d |
133020536500589 has 2 divisors, whose sum is σ = 133020536500590. Its totient is φ = 133020536500588.
The previous prime is 133020536500487. The next prime is 133020536500639. The reversal of 133020536500589 is 985005635020331.
It is an a-pointer prime, because the next prime (133020536500639) can be obtained adding 133020536500589 to its sum of digits (50).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 132114104928100 + 906431572489 = 11494090^2 + 952067^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133020536500589 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133020536509589) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66510268250294 + 66510268250295.
It is an arithmetic number, because the mean of its divisors is an integer number (66510268250295).
Almost surely, 2133020536500589 is an apocalyptic number.
It is an amenable number.
133020536500589 is a deficient number, since it is larger than the sum of its proper divisors (1).
133020536500589 is an equidigital number, since it uses as much as digits as its factorization.
133020536500589 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916000, while the sum is 50.
The spelling of 133020536500589 in words is "one hundred thirty-three trillion, twenty billion, five hundred thirty-six million, five hundred thousand, five hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •