Base | Representation |
---|---|
bin | 100110111111110110111… |
… | …000111011011000000000 |
3 | 100111012022022100002000020 |
4 | 212333312320323120000 |
5 | 322401422111300213 |
6 | 5411044314053440 |
7 | 364421405320530 |
oct | 46776670733000 |
9 | 10435268302006 |
10 | 2679906743808 |
11 | 9435a6545728 |
12 | 37347341a280 |
13 | 165938c045b8 |
14 | 939cb3554c0 |
15 | 49a9d047923 |
hex | 26ff6e3b600 |
2679906743808 has 160 divisors (see below), whose sum is σ = 8223610036224. Its totient is φ = 759658217472.
The previous prime is 2679906743749. The next prime is 2679906743831. The reversal of 2679906743808 is 8083476099762.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 384216 + ... + 2346792.
Almost surely, 22679906743808 is an apocalyptic number.
2679906743808 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 2679906743808, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4111805018112).
2679906743808 is an abundant number, since it is smaller than the sum of its proper divisors (5543703292416).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2679906743808 is a wasteful number, since it uses less digits than its factorization.
2679906743808 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1962732 (or 1962716 counting only the distinct ones).
The product of its (nonzero) digits is 219469824, while the sum is 69.
The spelling of 2679906743808 in words is "two trillion, six hundred seventy-nine billion, nine hundred six million, seven hundred forty-three thousand, eight hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.022 sec. • engine limits •