Base | Representation |
---|---|
bin | 111100111010101… |
… | …000011100110101 |
3 | 2122020002010112212 |
4 | 330322220130311 |
5 | 4043113043442 |
6 | 245225023205 |
7 | 34216611401 |
oct | 7472503465 |
9 | 2566063485 |
10 | 1022002997 |
11 | 484991a84 |
12 | 246324b05 |
13 | 133972202 |
14 | 99a38101 |
15 | 5eacaa82 |
hex | 3cea8735 |
1022002997 has 2 divisors, whose sum is σ = 1022002998. Its totient is φ = 1022002996.
The previous prime is 1022002963. The next prime is 1022003029. The reversal of 1022002997 is 7992002201.
It is an a-pointer prime, because the next prime (1022003029) can be obtained adding 1022002997 to its sum of digits (32).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 649281361 + 372721636 = 25481^2 + 19306^2 .
It is an emirp because it is prime and its reverse (7992002201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1022002997 - 226 = 954894133 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1022005997) 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, 511001498 + 511001499.
It is an arithmetic number, because the mean of its divisors is an integer number (511001499).
Almost surely, 21022002997 is an apocalyptic number.
It is an amenable number.
1022002997 is a deficient number, since it is larger than the sum of its proper divisors (1).
1022002997 is an equidigital number, since it uses as much as digits as its factorization.
1022002997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4536, while the sum is 32.
The square root of 1022002997 is about 31968.7816001799. The cubic root of 1022002997 is about 1007.2811879628.
The spelling of 1022002997 in words is "one billion, twenty-two million, two thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •