Base | Representation |
---|---|
bin | 1111111001000… |
… | …00000110010111 |
3 | 100021211101002102 |
4 | 13330200012113 |
5 | 233111110011 |
6 | 21121032315 |
7 | 3206015402 |
oct | 774400627 |
9 | 307741072 |
10 | 133300631 |
11 | 69276812 |
12 | 3878569b |
13 | 21802c19 |
14 | 139bcd39 |
15 | ba8173b |
hex | 7f20197 |
133300631 has 2 divisors, whose sum is σ = 133300632. Its totient is φ = 133300630.
The previous prime is 133300613. The next prime is 133300633. The reversal of 133300631 is 136003331.
Together with previous prime (133300613) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is an emirp because it is prime and its reverse (136003331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 133300631 - 26 = 133300567 is a prime.
It is a super-2 number, since 2×1333006312 = 35538116449996322, which contains 22 as substring.
Together with 133300633, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133300633) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66650315 + 66650316.
It is an arithmetic number, because the mean of its divisors is an integer number (66650316).
Almost surely, 2133300631 is an apocalyptic number.
133300631 is a deficient number, since it is larger than the sum of its proper divisors (1).
133300631 is an equidigital number, since it uses as much as digits as its factorization.
133300631 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 486, while the sum is 20.
The square root of 133300631 is about 11545.5892443825. The cubic root of 133300631 is about 510.8311846697.
Adding to 133300631 its reverse (136003331), we get a palindrome (269303962).
The spelling of 133300631 in words is "one hundred thirty-three million, three hundred thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •