Base | Representation |
---|---|
bin | 10011110011101… |
… | …111100010010101 |
3 | 212011100011122101 |
4 | 103303233202111 |
5 | 1140034044112 |
6 | 52551002101 |
7 | 11143524334 |
oct | 2363574225 |
9 | 764304571 |
10 | 332331157 |
11 | 160657354 |
12 | 93369331 |
13 | 53b0ab72 |
14 | 321cbd1b |
15 | 1e298757 |
hex | 13cef895 |
332331157 has 2 divisors, whose sum is σ = 332331158. Its totient is φ = 332331156.
The previous prime is 332331143. The next prime is 332331161. The reversal of 332331157 is 751133233.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 229795281 + 102535876 = 15159^2 + 10126^2 .
It is an emirp because it is prime and its reverse (751133233) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 332331157 - 27 = 332331029 is a prime.
It is a super-2 number, since 2×3323311572 = 220887995825917298, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (332331127) 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, 166165578 + 166165579.
It is an arithmetic number, because the mean of its divisors is an integer number (166165579).
Almost surely, 2332331157 is an apocalyptic number.
It is an amenable number.
332331157 is a deficient number, since it is larger than the sum of its proper divisors (1).
332331157 is an equidigital number, since it uses as much as digits as its factorization.
332331157 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5670, while the sum is 28.
The square root of 332331157 is about 18229.9521941227. The cubic root of 332331157 is about 692.6657065430.
The spelling of 332331157 in words is "three hundred thirty-two million, three hundred thirty-one thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •