Base | Representation |
---|---|
bin | 11110011000010001010011… |
… | …111111110110101000101101 |
3 | 122112001220211111012102020211 |
4 | 132120101103333312220231 |
5 | 120003023221441014012 |
6 | 1152055124251542421 |
7 | 40066643546456125 |
oct | 3630212377665055 |
9 | 575056744172224 |
10 | 133609251891757 |
11 | 39632402563734 |
12 | 12b9a45015aa11 |
13 | 59723b5748345 |
14 | 24dca17d9dc85 |
15 | 106a73aee16a7 |
hex | 798453ff6a2d |
133609251891757 has 2 divisors, whose sum is σ = 133609251891758. Its totient is φ = 133609251891756.
The previous prime is 133609251891697. The next prime is 133609251891767. The reversal of 133609251891757 is 757198152906331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 133608377270281 + 874621476 = 11558909^2 + 29574^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133609251891757 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 133609251891692 and 133609251891701.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133609251891767) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66804625945878 + 66804625945879.
It is an arithmetic number, because the mean of its divisors is an integer number (66804625945879).
Almost surely, 2133609251891757 is an apocalyptic number.
It is an amenable number.
133609251891757 is a deficient number, since it is larger than the sum of its proper divisors (1).
133609251891757 is an equidigital number, since it uses as much as digits as its factorization.
133609251891757 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 85730400, while the sum is 67.
The spelling of 133609251891757 in words is "one hundred thirty-three trillion, six hundred nine billion, two hundred fifty-one million, eight hundred ninety-one thousand, seven hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •