Base | Representation |
---|---|
bin | 1000001110101100… |
… | …0001111011011101 |
3 | 12200221210200011202 |
4 | 2003223001323131 |
5 | 14011012023024 |
6 | 1003112325245 |
7 | 105513000224 |
oct | 20353017335 |
9 | 5627720152 |
10 | 2209095389 |
11 | a33a82076 |
12 | 5179a3825 |
13 | 292897547 |
14 | 16d567cbb |
15 | cde16bae |
hex | 83ac1edd |
2209095389 has 2 divisors, whose sum is σ = 2209095390. Its totient is φ = 2209095388.
The previous prime is 2209095377. The next prime is 2209095431. The reversal of 2209095389 is 9835909022.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2064975364 + 144120025 = 45442^2 + 12005^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2209095389 is a prime.
It is a super-2 number, since 2×22090953892 = 9760204875402122642, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2209095689) 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, 1104547694 + 1104547695.
It is an arithmetic number, because the mean of its divisors is an integer number (1104547695).
Almost surely, 22209095389 is an apocalyptic number.
It is an amenable number.
2209095389 is a deficient number, since it is larger than the sum of its proper divisors (1).
2209095389 is an equidigital number, since it uses as much as digits as its factorization.
2209095389 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 349920, while the sum is 47.
The square root of 2209095389 is about 47001.0147656410. The cubic root of 2209095389 is about 1302.3813135984.
The spelling of 2209095389 in words is "two billion, two hundred nine million, ninety-five thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •