Base | Representation |
---|---|
bin | 101101011001111010011… |
… | …011010000010110001001 |
3 | 102001021210010012020000111 |
4 | 231121322123100112021 |
5 | 402110132224101324 |
6 | 10345222235234321 |
7 | 441266320200256 |
oct | 55317233202611 |
9 | 12037703166014 |
10 | 3120200222089 |
11 | aa32a67556a5 |
12 | 4248708a89a1 |
13 | 19830634b682 |
14 | ab038a7c42d |
15 | 5626c099794 |
hex | 2d67a6d0589 |
3120200222089 has 2 divisors, whose sum is σ = 3120200222090. Its totient is φ = 3120200222088.
The previous prime is 3120200222021. The next prime is 3120200222101. The reversal of 3120200222089 is 9802220020213.
3120200222089 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., 2241856382089 + 878343840000 = 1497283^2 + 937200^2 .
It is a cyclic number.
It is not a de Polignac number, because 3120200222089 - 211 = 3120200220041 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3120200222089.
It is not a weakly prime, because it can be changed into another prime (3120200232089) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1560100111044 + 1560100111045.
It is an arithmetic number, because the mean of its divisors is an integer number (1560100111045).
Almost surely, 23120200222089 is an apocalyptic number.
It is an amenable number.
3120200222089 is a deficient number, since it is larger than the sum of its proper divisors (1).
3120200222089 is an equidigital number, since it uses as much as digits as its factorization.
3120200222089 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 31.
The spelling of 3120200222089 in words is "three trillion, one hundred twenty billion, two hundred million, two hundred twenty-two thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •