Base | Representation |
---|---|
bin | 111100111011011… |
… | …000100011000001 |
3 | 2122020110010210022 |
4 | 330323120203001 |
5 | 4043140400001 |
6 | 245233143225 |
7 | 34221361634 |
oct | 7473304301 |
9 | 2566403708 |
10 | 1022200001 |
11 | 485006a99 |
12 | 2463bab15 |
13 | 133a10a94 |
14 | 99a89c1b |
15 | 5eb1911b |
hex | 3ced88c1 |
1022200001 has 2 divisors, whose sum is σ = 1022200002. Its totient is φ = 1022200000.
The previous prime is 1022199973. The next prime is 1022200009. The reversal of 1022200001 is 1000022201.
1022200001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (1022200009) can be obtained adding 1022200001 to its sum of digits (8).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 589518400 + 432681601 = 24280^2 + 20801^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1022200001 is a prime.
It is not a weakly prime, because it can be changed into another prime (1022200009) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 511100000 + 511100001.
It is an arithmetic number, because the mean of its divisors is an integer number (511100001).
Almost surely, 21022200001 is an apocalyptic number.
It is an amenable number.
1022200001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1022200001 is an equidigital number, since it uses as much as digits as its factorization.
1022200001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 8.
The square root of 1022200001 is about 31971.8626451447. The cubic root of 1022200001 is about 1007.3459058663.
Adding to 1022200001 its reverse (1000022201), we get a palindrome (2022222202).
The spelling of 1022200001 in words is "one billion, twenty-two million, two hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •