Base | Representation |
---|---|
bin | 101000001011001110100… |
… | …100011001001011000000 |
3 | 100202221012022110201010102 |
4 | 220023032210121023000 |
5 | 330213142132311231 |
6 | 5512150540021532 |
7 | 403315025221424 |
oct | 50131644311300 |
9 | 10687168421112 |
10 | 2760834650816 |
11 | 974955205000 |
12 | 387099b318a8 |
13 | 1704653541c8 |
14 | 978a7432b84 |
15 | 4bc37c06acb |
hex | 282ce9192c0 |
2760834650816 has 84 divisors (see below), whose sum is σ = 6027031450104. Its totient is φ = 1254704408320.
The previous prime is 2760834650771. The next prime is 2760834650837. The reversal of 2760834650816 is 6180564380672.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 484949666 + ... + 484955358.
It is an arithmetic number, because the mean of its divisors is an integer number (71750374406).
Almost surely, 22760834650816 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 2760834650816, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3013515725052).
2760834650816 is an abundant number, since it is smaller than the sum of its proper divisors (3266196799288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2760834650816 is an frugal number, since it uses more digits than its factorization.
2760834650816 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11431 (or 5706 counting only the distinct ones).
The product of its (nonzero) digits is 11612160, while the sum is 56.
The spelling of 2760834650816 in words is "two trillion, seven hundred sixty billion, eight hundred thirty-four million, six hundred fifty thousand, eight hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •