Base | Representation |
---|---|
bin | 1111110111100… |
… | …10011010110111 |
3 | 100021110212102122 |
4 | 13323302122313 |
5 | 233034113102 |
6 | 21113030155 |
7 | 3204306041 |
oct | 773623267 |
9 | 307425378 |
10 | 133113527 |
11 | 69159188 |
12 | 386b535b |
13 | 21768a01 |
14 | 13970a91 |
15 | ba460a2 |
hex | 7ef26b7 |
133113527 has 2 divisors, whose sum is σ = 133113528. Its totient is φ = 133113526.
The previous prime is 133113479. The next prime is 133113551. The reversal of 133113527 is 725311331.
It is a strong prime.
It is an emirp because it is prime and its reverse (725311331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 133113527 - 210 = 133112503 is a prime.
It is a super-2 number, since 2×1331135272 = 35438422140759458, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 133113496 and 133113505.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133113557) 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, 66556763 + 66556764.
It is an arithmetic number, because the mean of its divisors is an integer number (66556764).
Almost surely, 2133113527 is an apocalyptic number.
133113527 is a deficient number, since it is larger than the sum of its proper divisors (1).
133113527 is an equidigital number, since it uses as much as digits as its factorization.
133113527 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1890, while the sum is 26.
The square root of 133113527 is about 11537.4835644520. The cubic root of 133113527 is about 510.5920677429.
Adding to 133113527 its reverse (725311331), we get a palindrome (858424858).
The spelling of 133113527 in words is "one hundred thirty-three million, one hundred thirteen thousand, five hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •