Base | Representation |
---|---|
bin | 1110111001101011… |
… | …00101110010000001 |
3 | 202122112102021021212 |
4 | 13130311211302001 |
5 | 112341000100301 |
6 | 3401455455505 |
7 | 402150622331 |
oct | 73465456201 |
9 | 22575367255 |
10 | 8000003201 |
11 | 343587a8a3 |
12 | 1673227595 |
13 | 9a6544708 |
14 | 55c6a90c1 |
15 | 31c4eb4bb |
hex | 1dcd65c81 |
8000003201 has 2 divisors, whose sum is σ = 8000003202. Its totient is φ = 8000003200.
The previous prime is 8000003183. The next prime is 8000003203. The reversal of 8000003201 is 1023000008.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6610503025 + 1389500176 = 81305^2 + 37276^2 .
It is a cyclic number.
It is not a de Polignac number, because 8000003201 - 214 = 7999986817 is a prime.
Together with 8000003203, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (8000003203) 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, 4000001600 + 4000001601.
It is an arithmetic number, because the mean of its divisors is an integer number (4000001601).
Almost surely, 28000003201 is an apocalyptic number.
It is an amenable number.
8000003201 is a deficient number, since it is larger than the sum of its proper divisors (1).
8000003201 is an equidigital number, since it uses as much as digits as its factorization.
8000003201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 8000003201 is about 89442.7369941238. The cubic root of 8000003201 is about 2000.0002667500. Note that the first 3 decimals are identical.
Adding to 8000003201 its reverse (1023000008), we get a palindrome (9023003209).
The spelling of 8000003201 in words is "eight billion, three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •