Base | Representation |
---|---|
bin | 100100011011000… |
… | …0001101001011001 |
3 | 10011011122020022111 |
4 | 1020312001221121 |
5 | 10000330401243 |
6 | 321134152321 |
7 | 42166603054 |
oct | 11066015131 |
9 | 3134566274 |
10 | 1222122073 |
11 | 577946447 |
12 | 2a13526a1 |
13 | 16626b773 |
14 | b844ba9b |
15 | 7245a39d |
hex | 48d81a59 |
1222122073 has 2 divisors, whose sum is σ = 1222122074. Its totient is φ = 1222122072.
The previous prime is 1222122067. The next prime is 1222122103. The reversal of 1222122073 is 3702212221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 714385984 + 507736089 = 26728^2 + 22533^2 .
It is a cyclic number.
It is not a de Polignac number, because 1222122073 - 29 = 1222121561 is a prime.
It is a super-2 number, since 2×12221220732 = 2987164722627634658, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1222122053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 611061036 + 611061037.
It is an arithmetic number, because the mean of its divisors is an integer number (611061037).
Almost surely, 21222122073 is an apocalyptic number.
It is an amenable number.
1222122073 is a deficient number, since it is larger than the sum of its proper divisors (1).
1222122073 is an equidigital number, since it uses as much as digits as its factorization.
1222122073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 672, while the sum is 22.
The square root of 1222122073 is about 34958.8625816115. The cubic root of 1222122073 is about 1069.1489062856.
Adding to 1222122073 its reverse (3702212221), we get a palindrome (4924334294).
The spelling of 1222122073 in words is "one billion, two hundred twenty-two million, one hundred twenty-two thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •