Base | Representation |
---|---|
bin | 100111011001111000110… |
… | …001100110101110010100 |
3 | 100120212110010011102200010 |
4 | 213121320301212232110 |
5 | 323331142022303233 |
6 | 5431545520320220 |
7 | 366431121251100 |
oct | 47317061465624 |
9 | 10525403142603 |
10 | 2707855666068 |
11 | 954438a25693 |
12 | 378973473070 |
13 | 16847137a517 |
14 | 950bd20a900 |
15 | 4a686a6eb63 |
hex | 27678c66b94 |
2707855666068 has 144 divisors (see below), whose sum is σ = 7551928617408. Its totient is φ = 752520384000.
The previous prime is 2707855666051. The next prime is 2707855666093. The reversal of 2707855666068 is 8606665587072.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 7810078 + ... + 8149418.
It is an arithmetic number, because the mean of its divisors is an integer number (52443948732).
Almost surely, 22707855666068 is an apocalyptic number.
2707855666068 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2707855666068, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3775964308704).
2707855666068 is an abundant number, since it is smaller than the sum of its proper divisors (4844072951340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2707855666068 is a wasteful number, since it uses less digits than its factorization.
2707855666068 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 339734 (or 339725 counting only the distinct ones).
The product of its (nonzero) digits is 203212800, while the sum is 66.
The spelling of 2707855666068 in words is "two trillion, seven hundred seven billion, eight hundred fifty-five million, six hundred sixty-six thousand, sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •