Base | Representation |
---|---|
bin | 101111100101110010011110… |
… | …000000101110101110001001 |
3 | 1000110002100210010121000212211 |
4 | 233211302132000232232021 |
5 | 204413223113244311134 |
6 | 2021053215513505121 |
7 | 62041533644112166 |
oct | 5745623600565611 |
9 | 1013070703530784 |
10 | 209304997260169 |
11 | 60766829424258 |
12 | 1b5848641121a1 |
13 | 8ca34b8389c45 |
14 | 39985b73d906d |
15 | 192e7839de764 |
hex | be5c9e02eb89 |
209304997260169 has 2 divisors, whose sum is σ = 209304997260170. Its totient is φ = 209304997260168.
The previous prime is 209304997260167. The next prime is 209304997260179. The reversal of 209304997260169 is 961062799403902.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 158571358470144 + 50733638790025 = 12592512^2 + 7122755^2 .
It is a cyclic number.
It is not a de Polignac number, because 209304997260169 - 21 = 209304997260167 is a prime.
It is a super-2 number, since 2×2093049972601692 (a number of 29 digits) contains 22 as substring.
Together with 209304997260167, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (209304997260167) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 104652498630084 + 104652498630085.
It is an arithmetic number, because the mean of its divisors is an integer number (104652498630085).
Almost surely, 2209304997260169 is an apocalyptic number.
It is an amenable number.
209304997260169 is a deficient number, since it is larger than the sum of its proper divisors (1).
209304997260169 is an equidigital number, since it uses as much as digits as its factorization.
209304997260169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 79361856, while the sum is 67.
The spelling of 209304997260169 in words is "two hundred nine trillion, three hundred four billion, nine hundred ninety-seven million, two hundred sixty thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •