Base | Representation |
---|---|
bin | 1001100110101100011… |
… | …00001000101110111001 |
3 | 1011112211000221211000102 |
4 | 10303112030020232321 |
5 | 20401330310121332 |
6 | 411334401245145 |
7 | 32561660250164 |
oct | 4632614105671 |
9 | 1145730854012 |
10 | 330011020217 |
11 | 117a58687a4a |
12 | 53b600337b5 |
13 | 25173581a38 |
14 | 11d88c18adb |
15 | 88b7263062 |
hex | 4cd6308bb9 |
330011020217 has 2 divisors, whose sum is σ = 330011020218. Its totient is φ = 330011020216.
The previous prime is 330011020189. The next prime is 330011020271. The reversal of 330011020217 is 712020110033.
Together with next prime (330011020271) 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., 300280984441 + 29730035776 = 547979^2 + 172424^2 .
It is an emirp because it is prime and its reverse (712020110033) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 330011020217 - 26 = 330011020153 is a prime.
It is not a weakly prime, because it can be changed into another prime (330011023217) 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, 165005510108 + 165005510109.
It is an arithmetic number, because the mean of its divisors is an integer number (165005510109).
Almost surely, 2330011020217 is an apocalyptic number.
It is an amenable number.
330011020217 is a deficient number, since it is larger than the sum of its proper divisors (1).
330011020217 is an equidigital number, since it uses as much as digits as its factorization.
330011020217 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252, while the sum is 20.
The spelling of 330011020217 in words is "three hundred thirty billion, eleven million, twenty thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •