Base | Representation |
---|---|
bin | 100110111110111000010… |
… | …101000000010110111100 |
3 | 100111002121011022122202221 |
4 | 212332320111000112330 |
5 | 322342244411432034 |
6 | 5410352221255124 |
7 | 364353401661220 |
oct | 46767025002674 |
9 | 10432534278687 |
10 | 2678857139644 |
11 | 943108021574 |
12 | 37321ba044a4 |
13 | 1657cc61a24a |
14 | 9392bbb4780 |
15 | 49a3ad18bb4 |
hex | 26fb85405bc |
2678857139644 has 12 divisors (see below), whose sum is σ = 5357714279344. Its totient is φ = 1148081631264.
The previous prime is 2678857139639. The next prime is 2678857139701. The reversal of 2678857139644 is 4469317588762.
2678857139644 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
2678857139644 is an admirable number.
It is a super-3 number, since 3×26788571396443 (a number of 38 digits) contains 333 as substring.
It is a hoax number, since the sum of its digits (70) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 47836734609 + ... + 47836734664.
Almost surely, 22678857139644 is an apocalyptic number.
It is an amenable number.
2678857139644 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2678857139644 is a wasteful number, since it uses less digits than its factorization.
2678857139644 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95673469284 (or 95673469282 counting only the distinct ones).
The product of its digits is 487710720, while the sum is 70.
The spelling of 2678857139644 in words is "two trillion, six hundred seventy-eight billion, eight hundred fifty-seven million, one hundred thirty-nine thousand, six hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •