Base | Representation |
---|---|
bin | 1111111001010… |
… | …00100001011101 |
3 | 100021220010102021 |
4 | 13330220201131 |
5 | 233113211013 |
6 | 21121500141 |
7 | 3206221111 |
oct | 774504135 |
9 | 307803367 |
10 | 133335133 |
11 | 6929a728 |
12 | 387a1651 |
13 | 21815839 |
14 | 139cb741 |
15 | ba8ba8d |
hex | 7f2885d |
133335133 has 4 divisors (see below), whose sum is σ = 134709820. Its totient is φ = 131960448.
The previous prime is 133335119. The next prime is 133335143. The reversal of 133335133 is 331533331.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 30880249 + 102454884 = 5557^2 + 10122^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133335133 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 133335098 and 133335107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133335143) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 687198 + ... + 687391.
It is an arithmetic number, because the mean of its divisors is an integer number (33677455).
Almost surely, 2133335133 is an apocalyptic number.
It is an amenable number.
133335133 is a deficient number, since it is larger than the sum of its proper divisors (1374687).
133335133 is an equidigital number, since it uses as much as digits as its factorization.
133335133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1374686.
The product of its digits is 3645, while the sum is 25.
The square root of 133335133 is about 11547.0833113821. The cubic root of 133335133 is about 510.8752534213.
Adding to 133335133 its reverse (331533331), we get a palindrome (464868464).
The spelling of 133335133 in words is "one hundred thirty-three million, three hundred thirty-five thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.447 sec. • engine limits •