Base | Representation |
---|---|
bin | 10011110111001… |
… | …000100010100001 |
3 | 212020000022220112 |
4 | 103313020202201 |
5 | 1140301020001 |
6 | 53022021105 |
7 | 11154215612 |
oct | 2367104241 |
9 | 766008815 |
10 | 333220001 |
11 | 161104134 |
12 | 93717795 |
13 | 5405c5ca |
14 | 3237dc09 |
15 | 1e3c1cbb |
hex | 13dc88a1 |
333220001 has 2 divisors, whose sum is σ = 333220002. Its totient is φ = 333220000.
The previous prime is 333219983. The next prime is 333220033. The reversal of 333220001 is 100022333.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 331203601 + 2016400 = 18199^2 + 1420^2 .
It is a cyclic number.
It is not a de Polignac number, because 333220001 - 214 = 333203617 is a prime.
It is a super-2 number, since 2×3332200012 = 222071138132880002, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (333220051) 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, 166610000 + 166610001.
It is an arithmetic number, because the mean of its divisors is an integer number (166610001).
Almost surely, 2333220001 is an apocalyptic number.
It is an amenable number.
333220001 is a deficient number, since it is larger than the sum of its proper divisors (1).
333220001 is an equidigital number, since it uses as much as digits as its factorization.
333220001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 14.
The square root of 333220001 is about 18254.3145858726. The cubic root of 333220001 is about 693.2826851922.
Adding to 333220001 its reverse (100022333), we get a palindrome (433242334).
The spelling of 333220001 in words is "three hundred thirty-three million, two hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •