Base | Representation |
---|---|
bin | 111110000001101011… |
… | …0011111010100001001 |
3 | 110201210221200220220202 |
4 | 1330003112133110021 |
5 | 4140243223311012 |
6 | 141105154501545 |
7 | 12423553063106 |
oct | 1740326372411 |
9 | 421727626822 |
10 | 133200213257 |
11 | 51543058781 |
12 | 219945948b5 |
13 | c739bb9447 |
14 | 663850baad |
15 | 36e8ca4cc2 |
hex | 1f0359f509 |
133200213257 has 2 divisors, whose sum is σ = 133200213258. Its totient is φ = 133200213256.
The previous prime is 133200213221. The next prime is 133200213313. The reversal of 133200213257 is 752312002331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 118025915401 + 15174297856 = 343549^2 + 123184^2 .
It is an emirp because it is prime and its reverse (752312002331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 133200213257 - 26 = 133200213193 is a prime.
It is not a weakly prime, because it can be changed into another prime (133200213457) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66600106628 + 66600106629.
It is an arithmetic number, because the mean of its divisors is an integer number (66600106629).
Almost surely, 2133200213257 is an apocalyptic number.
It is an amenable number.
133200213257 is a deficient number, since it is larger than the sum of its proper divisors (1).
133200213257 is an equidigital number, since it uses as much as digits as its factorization.
133200213257 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7560, while the sum is 29.
Adding to 133200213257 its reverse (752312002331), we get a palindrome (885512215588).
The spelling of 133200213257 in words is "one hundred thirty-three billion, two hundred million, two hundred thirteen thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •