Base | Representation |
---|---|
bin | 1111111000010… |
… | …00011001000011 |
3 | 100021122102212211 |
4 | 13330020121003 |
5 | 233100003043 |
6 | 21115002551 |
7 | 3205132315 |
oct | 774103103 |
9 | 307572784 |
10 | 133203523 |
11 | 6920a862 |
12 | 38739457 |
13 | 2179a96b |
14 | 139957b5 |
15 | ba62a9d |
hex | 7f08643 |
133203523 has 2 divisors, whose sum is σ = 133203524. Its totient is φ = 133203522.
The previous prime is 133203503. The next prime is 133203527. The reversal of 133203523 is 325302331.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (325302331) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133203523 is a prime.
It is a super-2 number, since 2×1332035232 = 35486357079223058, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 133203494 and 133203503.
It is not a weakly prime, because it can be changed into another prime (133203527) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66601761 + 66601762.
It is an arithmetic number, because the mean of its divisors is an integer number (66601762).
Almost surely, 2133203523 is an apocalyptic number.
133203523 is a deficient number, since it is larger than the sum of its proper divisors (1).
133203523 is an equidigital number, since it uses as much as digits as its factorization.
133203523 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1620, while the sum is 22.
The square root of 133203523 is about 11541.3830627009. The cubic root of 133203523 is about 510.7071096249.
Adding to 133203523 its reverse (325302331), we get a palindrome (458505854).
The spelling of 133203523 in words is "one hundred thirty-three million, two hundred three thousand, five hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •