Base | Representation |
---|---|
bin | 1111110111111… |
… | …11000101010101 |
3 | 100021120111120202 |
4 | 13323333011111 |
5 | 233042243042 |
6 | 21114110245 |
7 | 3204613211 |
oct | 773770525 |
9 | 307514522 |
10 | 133165397 |
11 | 69194152 |
12 | 3871b385 |
13 | 217864c1 |
14 | 13985941 |
15 | ba56632 |
hex | 7eff155 |
133165397 has 2 divisors, whose sum is σ = 133165398. Its totient is φ = 133165396.
The previous prime is 133165387. The next prime is 133165411. The reversal of 133165397 is 793561331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 86843761 + 46321636 = 9319^2 + 6806^2 .
It is a cyclic number.
It is not a de Polignac number, because 133165397 - 214 = 133149013 is a prime.
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 133165397.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133165327) 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 as a sum of consecutive naturals, namely, 66582698 + 66582699.
It is an arithmetic number, because the mean of its divisors is an integer number (66582699).
Almost surely, 2133165397 is an apocalyptic number.
It is an amenable number.
133165397 is a deficient number, since it is larger than the sum of its proper divisors (1).
133165397 is an equidigital number, since it uses as much as digits as its factorization.
133165397 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 51030, while the sum is 38.
The square root of 133165397 is about 11539.7312360384. The cubic root of 133165397 is about 510.6583794891.
The spelling of 133165397 in words is "one hundred thirty-three million, one hundred sixty-five thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •