Base | Representation |
---|---|
bin | 100111000111001101001… |
… | …001111101011000000000 |
3 | 100111221200011022012210100 |
4 | 213013031021331120000 |
5 | 323014101400444333 |
6 | 5414431235002400 |
7 | 365121050202216 |
oct | 47071511753000 |
9 | 10457604265710 |
10 | 2687796499968 |
11 | 946985065268 |
12 | 374ab5739400 |
13 | 1665c5658378 |
14 | 94139122cb6 |
15 | 49db0a18213 |
hex | 271cd27d600 |
2687796499968 has 120 divisors (see below), whose sum is σ = 7790458340808. Its totient is φ = 892086607872.
The previous prime is 2687796499937. The next prime is 2687796499987. The reversal of 2687796499968 is 8699946977862.
2687796499968 is a `hidden beast` number, since 26 + 8 + 7 + 7 + 9 + 6 + 499 + 96 + 8 = 666.
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 178030 + ... + 2325357.
Almost surely, 22687796499968 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2687796499968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3895229170404).
2687796499968 is an abundant number, since it is smaller than the sum of its proper divisors (5102661840840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2687796499968 is a wasteful number, since it uses less digits than its factorization.
2687796499968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2503644 (or 2503625 counting only the distinct ones).
The product of its digits is 35554111488, while the sum is 90.
The spelling of 2687796499968 in words is "two trillion, six hundred eighty-seven billion, seven hundred ninety-six million, four hundred ninety-nine thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •