Base | Representation |
---|---|
bin | 11111101100000101001… |
… | …000000000011011111001 |
3 | 21201011212002022112200101 |
4 | 133230011020000123321 |
5 | 241134243401412324 |
6 | 4344220314435401 |
7 | 313220545012054 |
oct | 37540510003371 |
9 | 7634762275611 |
10 | 2177634404089 |
11 | 76a590939821 |
12 | 2b2059432b61 |
13 | 12a472077711 |
14 | 77580423a9b |
15 | 3b9a2ba8944 |
hex | 1fb052006f9 |
2177634404089 has 4 divisors (see below), whose sum is σ = 2305730545524. Its totient is φ = 2049538262656.
The previous prime is 2177634404087. The next prime is 2177634404107. The reversal of 2177634404089 is 9804044367712.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1649447038864 + 528187365225 = 1284308^2 + 726765^2 .
It is a cyclic number.
It is not a de Polignac number, because 2177634404089 - 21 = 2177634404087 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2177634404087) 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 in 3 ways as a sum of consecutive naturals, for example, 64048070692 + ... + 64048070725.
It is an arithmetic number, because the mean of its divisors is an integer number (576432636381).
Almost surely, 22177634404089 is an apocalyptic number.
It is an amenable number.
2177634404089 is a deficient number, since it is larger than the sum of its proper divisors (128096141435).
2177634404089 is a wasteful number, since it uses less digits than its factorization.
2177634404089 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128096141434.
The product of its (nonzero) digits is 8128512, while the sum is 55.
The spelling of 2177634404089 in words is "two trillion, one hundred seventy-seven billion, six hundred thirty-four million, four hundred four thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •