Base | Representation |
---|---|
bin | 1111111001011… |
… | …11000111010111 |
3 | 100021221111110100 |
4 | 13330233013113 |
5 | 233120042020 |
6 | 21122225143 |
7 | 3206362614 |
oct | 774570727 |
9 | 307844410 |
10 | 133362135 |
11 | 69308a45 |
12 | 387b51b3 |
13 | 21824c0a |
14 | 139d750b |
15 | ba94a90 |
hex | 7f2f1d7 |
133362135 has 48 divisors (see below), whose sum is σ = 242450208. Its totient is φ = 67777920.
The previous prime is 133362133. The next prime is 133362169. The reversal of 133362135 is 531263331.
It is a happy number.
133362135 is a `hidden beast` number, since 1 + 3 + 3 + 3 + 621 + 35 = 666.
It is not a de Polignac number, because 133362135 - 21 = 133362133 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 133362099 and 133362108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133362133) 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 in 47 ways as a sum of consecutive naturals, for example, 3101424 + ... + 3101466.
It is an arithmetic number, because the mean of its divisors is an integer number (5051046).
Almost surely, 2133362135 is an apocalyptic number.
133362135 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
133362135 is a deficient number, since it is larger than the sum of its proper divisors (109088073).
133362135 is an frugal number, since it uses more digits than its factorization.
133362135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 177 (or 92 counting only the distinct ones).
The product of its digits is 4860, while the sum is 27.
The square root of 133362135 is about 11548.2524652001. The cubic root of 133362135 is about 510.9097372621.
The spelling of 133362135 in words is "one hundred thirty-three million, three hundred sixty-two thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •