Base | Representation |
---|---|
bin | 111100111011100… |
… | …000001010101001 |
3 | 2122020111201121011 |
4 | 330323200022221 |
5 | 4043142344314 |
6 | 245233543521 |
7 | 34221551626 |
oct | 7473401251 |
9 | 2566451534 |
10 | 1022231209 |
11 | 48502848a |
12 | 246414ba1 |
13 | 133a2204c |
14 | 99a9734d |
15 | 5eb234c4 |
hex | 3cee02a9 |
1022231209 has 2 divisors, whose sum is σ = 1022231210. Its totient is φ = 1022231208.
The previous prime is 1022231207. The next prime is 1022231263. The reversal of 1022231209 is 9021322201.
1022231209 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1014613609 + 7617600 = 31853^2 + 2760^2 .
It is a cyclic number.
It is not a de Polignac number, because 1022231209 - 21 = 1022231207 is a prime.
Together with 1022231207, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 1022231209.
It is not a weakly prime, because it can be changed into another prime (1022231207) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 511115604 + 511115605.
It is an arithmetic number, because the mean of its divisors is an integer number (511115605).
Almost surely, 21022231209 is an apocalyptic number.
It is an amenable number.
1022231209 is a deficient number, since it is larger than the sum of its proper divisors (1).
1022231209 is an equidigital number, since it uses as much as digits as its factorization.
1022231209 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 22.
The square root of 1022231209 is about 31972.3506955619. The cubic root of 1022231209 is about 1007.3561572623.
The spelling of 1022231209 in words is "one billion, twenty-two million, two hundred thirty-one thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •