Base | Representation |
---|---|
bin | 100100011100101… |
… | …1010111101110001 |
3 | 10011020022110100111 |
4 | 1020321122331301 |
5 | 10001042342314 |
6 | 321205221321 |
7 | 42210301156 |
oct | 11071327561 |
9 | 3136273314 |
10 | 1223012209 |
11 | 5783a41a1 |
12 | 2a1701841 |
13 | 1664c0983 |
14 | b860022d |
15 | 72583ec4 |
hex | 48e5af71 |
1223012209 has 2 divisors, whose sum is σ = 1223012210. Its totient is φ = 1223012208.
The previous prime is 1223012173. The next prime is 1223012227. The reversal of 1223012209 is 9022103221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1183360000 + 39652209 = 34400^2 + 6297^2 .
It is a cyclic number.
It is not a de Polignac number, because 1223012209 - 27 = 1223012081 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1223012209.
It is not a weakly prime, because it can be changed into another prime (1223016209) 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, 611506104 + 611506105.
It is an arithmetic number, because the mean of its divisors is an integer number (611506105).
Almost surely, 21223012209 is an apocalyptic number.
It is an amenable number.
1223012209 is a deficient number, since it is larger than the sum of its proper divisors (1).
1223012209 is an equidigital number, since it uses as much as digits as its factorization.
1223012209 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 1223012209 is about 34971.5914564951. The cubic root of 1223012209 is about 1069.4084158143.
It can be divided in two parts, 1223012 and 209, that added together give a palindrome (1223221).
The spelling of 1223012209 in words is "one billion, two hundred twenty-three million, twelve thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •