Base | Representation |
---|---|
bin | 101010010101100111000… |
… | …110111001110010100001 |
3 | 101022010201200010211001212 |
4 | 222111213012321302201 |
5 | 340131444204102314 |
6 | 10104323110035505 |
7 | 420125131045643 |
oct | 52254706716241 |
9 | 11263650124055 |
10 | 2909422722209 |
11 | a21974307303 |
12 | 3aba47948b95 |
13 | 181485239543 |
14 | a0b61488893 |
15 | 50a32886e3e |
hex | 2a5671b9ca1 |
2909422722209 has 2 divisors, whose sum is σ = 2909422722210. Its totient is φ = 2909422722208.
The previous prime is 2909422722203. The next prime is 2909422722233. The reversal of 2909422722209 is 9022272249092.
2909422722209 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., 2135105440000 + 774317282209 = 1461200^2 + 879953^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2909422722209 is a prime.
It is a super-3 number, since 3×29094227222093 (a number of 38 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (2909422722203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1454711361104 + 1454711361105.
It is an arithmetic number, because the mean of its divisors is an integer number (1454711361105).
Almost surely, 22909422722209 is an apocalyptic number.
It is an amenable number.
2909422722209 is a deficient number, since it is larger than the sum of its proper divisors (1).
2909422722209 is an equidigital number, since it uses as much as digits as its factorization.
2909422722209 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1306368, while the sum is 50.
The spelling of 2909422722209 in words is "two trillion, nine hundred nine billion, four hundred twenty-two million, seven hundred twenty-two thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •