Base | Representation |
---|---|
bin | 111100111010101… |
… | …010001000101001 |
3 | 2122020002111000102 |
4 | 330322222020221 |
5 | 4043113304042 |
6 | 245225115145 |
7 | 34216640456 |
oct | 7472521051 |
9 | 2566074012 |
10 | 1022009897 |
11 | 484997187 |
12 | 246328ab5 |
13 | 1339753ac |
14 | 99a3a82d |
15 | 5eaccb32 |
hex | 3ceaa229 |
1022009897 has 2 divisors, whose sum is σ = 1022009898. Its totient is φ = 1022009896.
The previous prime is 1022009831. The next prime is 1022009903. The reversal of 1022009897 is 7989002201.
1022009897 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1019588761 + 2421136 = 31931^2 + 1556^2 .
It is an emirp because it is prime and its reverse (7989002201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1022009897 - 220 = 1020961321 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1022009897.
It is not a weakly prime, because it can be changed into another prime (1022009497) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 511004948 + 511004949.
It is an arithmetic number, because the mean of its divisors is an integer number (511004949).
Almost surely, 21022009897 is an apocalyptic number.
It is an amenable number.
1022009897 is a deficient number, since it is larger than the sum of its proper divisors (1).
1022009897 is an equidigital number, since it uses as much as digits as its factorization.
1022009897 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18144, while the sum is 38.
The square root of 1022009897 is about 31968.8895177796. The cubic root of 1022009897 is about 1007.2834548265.
The spelling of 1022009897 in words is "one billion, twenty-two million, nine thousand, eight hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •