Base | Representation |
---|---|
bin | 1111110111000… |
… | …11000110001001 |
3 | 100021100200022222 |
4 | 13323203012021 |
5 | 233030111021 |
6 | 21111423425 |
7 | 3203625044 |
oct | 773430611 |
9 | 307320288 |
10 | 133050761 |
11 | 69116008 |
12 | 38684b75 |
13 | 2174627c |
14 | 13955c5b |
15 | ba326ab |
hex | 7ee3189 |
133050761 has 2 divisors, whose sum is σ = 133050762. Its totient is φ = 133050760.
The previous prime is 133050751. The next prime is 133050763. The reversal of 133050761 is 167050331.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 117050761 + 16000000 = 10819^2 + 4000^2 .
It is a cyclic number.
It is not a de Polignac number, because 133050761 - 222 = 128856457 is a prime.
Together with 133050763, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 133050761.
It is not a weakly prime, because it can be changed into another prime (133050763) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66525380 + 66525381.
It is an arithmetic number, because the mean of its divisors is an integer number (66525381).
Almost surely, 2133050761 is an apocalyptic number.
It is an amenable number.
133050761 is a deficient number, since it is larger than the sum of its proper divisors (1).
133050761 is an equidigital number, since it uses as much as digits as its factorization.
133050761 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1890, while the sum is 26.
The square root of 133050761 is about 11534.7631531818. The cubic root of 133050761 is about 510.5118032728.
The spelling of 133050761 in words is "one hundred thirty-three million, fifty thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •