Base | Representation |
---|---|
bin | 110010110010001000… |
… | …1110001111011010101 |
3 | 101102111100011111210011 |
4 | 1211210101301323111 |
5 | 3241321440034244 |
6 | 122033324400221 |
7 | 10610344335643 |
oct | 1454421617325 |
9 | 342440144704 |
10 | 109056564949 |
11 | 42283651422 |
12 | 191769a6071 |
13 | a38cc06307 |
14 | 53c7b9c193 |
15 | 2c8438b434 |
hex | 1964471ed5 |
109056564949 has 2 divisors, whose sum is σ = 109056564950. Its totient is φ = 109056564948.
The previous prime is 109056564853. The next prime is 109056564983. The reversal of 109056564949 is 949465650901.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 92154744900 + 16901820049 = 303570^2 + 130007^2 .
It is an emirp because it is prime and its reverse (949465650901) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 109056564949 - 219 = 109056040661 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 109056564893 and 109056564902.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (109056564989) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 54528282474 + 54528282475.
It is an arithmetic number, because the mean of its divisors is an integer number (54528282475).
Almost surely, 2109056564949 is an apocalyptic number.
It is an amenable number.
109056564949 is a deficient number, since it is larger than the sum of its proper divisors (1).
109056564949 is an equidigital number, since it uses as much as digits as its factorization.
109056564949 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10497600, while the sum is 58.
The spelling of 109056564949 in words is "one hundred nine billion, fifty-six million, five hundred sixty-four thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •