Base | Representation |
---|---|
bin | 10011110011100… |
… | …001001100100001 |
3 | 212011020012001211 |
4 | 103303201030201 |
5 | 1140030204132 |
6 | 52545430121 |
7 | 11143161151 |
oct | 2363411441 |
9 | 764205054 |
10 | 332272417 |
11 | 160617204 |
12 | 9333b341 |
13 | 53aba1c9 |
14 | 321b4761 |
15 | 1e286147 |
hex | 13ce1321 |
332272417 has 2 divisors, whose sum is σ = 332272418. Its totient is φ = 332272416.
The previous prime is 332272397. The next prime is 332272471. The reversal of 332272417 is 714272233.
Together with next prime (332272471) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 191517921 + 140754496 = 13839^2 + 11864^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-332272417 is a prime.
It is a super-2 number, since 2×3322724172 = 220809918198043778, which contains 22 as substring.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (332212417) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 166136208 + 166136209.
It is an arithmetic number, because the mean of its divisors is an integer number (166136209).
Almost surely, 2332272417 is an apocalyptic number.
It is an amenable number.
332272417 is a deficient number, since it is larger than the sum of its proper divisors (1).
332272417 is an equidigital number, since it uses as much as digits as its factorization.
332272417 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 14112, while the sum is 31.
The square root of 332272417 is about 18228.3410380649. The cubic root of 332272417 is about 692.6248942587.
The spelling of 332272417 in words is "three hundred thirty-two million, two hundred seventy-two thousand, four hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •