Base | Representation |
---|---|
bin | 1111111001000… |
… | …10111011111101 |
3 | 100021211222000212 |
4 | 13330202323331 |
5 | 233111443003 |
6 | 21121202205 |
7 | 3206064314 |
oct | 774427375 |
9 | 307758025 |
10 | 133312253 |
11 | 69284518 |
12 | 38790365 |
13 | 218082b9 |
14 | 139c327b |
15 | ba84dd8 |
hex | 7f22efd |
133312253 has 2 divisors, whose sum is σ = 133312254. Its totient is φ = 133312252.
The previous prime is 133312229. The next prime is 133312261. The reversal of 133312253 is 352213331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 129458884 + 3853369 = 11378^2 + 1963^2 .
It is an emirp because it is prime and its reverse (352213331) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133312253 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133312213) 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, 66656126 + 66656127.
It is an arithmetic number, because the mean of its divisors is an integer number (66656127).
Almost surely, 2133312253 is an apocalyptic number.
It is an amenable number.
133312253 is a deficient number, since it is larger than the sum of its proper divisors (1).
133312253 is an equidigital number, since it uses as much as digits as its factorization.
133312253 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1620, while the sum is 23.
The square root of 133312253 is about 11546.0925425011. The cubic root of 133312253 is about 510.8460300796.
Adding to 133312253 its reverse (352213331), we get a palindrome (485525584).
The spelling of 133312253 in words is "one hundred thirty-three million, three hundred twelve thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •