Base | Representation |
---|---|
bin | 1111110110111… |
… | …10010000101101 |
3 | 100021022200011111 |
4 | 13323132100231 |
5 | 233023442312 |
6 | 21111152021 |
7 | 3203513233 |
oct | 773362055 |
9 | 307280144 |
10 | 133030957 |
11 | 69102144 |
12 | 38675611 |
13 | 2173a257 |
14 | 1394c953 |
15 | ba2b8a7 |
hex | 7ede42d |
133030957 has 2 divisors, whose sum is σ = 133030958. Its totient is φ = 133030956.
The previous prime is 133030943. The next prime is 133031051. The reversal of 133030957 is 759030331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 88755241 + 44275716 = 9421^2 + 6654^2 .
It is a cyclic number.
It is not a de Polignac number, because 133030957 - 27 = 133030829 is a prime.
It is equal to p7540258 and since 133030957 and 7540258 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133030907) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66515478 + 66515479.
It is an arithmetic number, because the mean of its divisors is an integer number (66515479).
Almost surely, 2133030957 is an apocalyptic number.
It is an amenable number.
133030957 is a deficient number, since it is larger than the sum of its proper divisors (1).
133030957 is an equidigital number, since it uses as much as digits as its factorization.
133030957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8505, while the sum is 31.
The square root of 133030957 is about 11533.9046727463. The cubic root of 133030957 is about 510.4864728968.
The spelling of 133030957 in words is "one hundred thirty-three million, thirty thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •