Base | Representation |
---|---|
bin | 101111100111100000000000… |
… | …001001000101010101100101 |
3 | 1000110111121100121110010212101 |
4 | 233213200000021011111211 |
5 | 204422140000034442432 |
6 | 2021223230130252101 |
7 | 62053166306463301 |
oct | 5747400011052545 |
9 | 1013447317403771 |
10 | 209422607734117 |
11 | 608016a1480058 |
12 | 1b5a3607727031 |
13 | 8cb160c4b4b6b |
14 | 39a017324ad01 |
15 | 1932868cdc4e7 |
hex | be7800245565 |
209422607734117 has 4 divisors (see below), whose sum is σ = 214292900937280. Its totient is φ = 204552314530956.
The previous prime is 209422607734073. The next prime is 209422607734141. The reversal of 209422607734117 is 711437706224902.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-209422607734117 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (209422607734157) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2435146601517 + ... + 2435146601602.
It is an arithmetic number, because the mean of its divisors is an integer number (53573225234320).
Almost surely, 2209422607734117 is an apocalyptic number.
It is an amenable number.
209422607734117 is a deficient number, since it is larger than the sum of its proper divisors (4870293203163).
209422607734117 is an equidigital number, since it uses as much as digits as its factorization.
209422607734117 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4870293203162.
The product of its (nonzero) digits is 7112448, while the sum is 55.
The spelling of 209422607734117 in words is "two hundred nine trillion, four hundred twenty-two billion, six hundred seven million, seven hundred thirty-four thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •