Base | Representation |
---|---|
bin | 1010000010111111… |
… | …0001101100110000 |
3 | 20221221122122100120 |
4 | 2200233301230300 |
5 | 21010400111041 |
6 | 1123335250240 |
7 | 123555043455 |
oct | 24057615460 |
9 | 6857578316 |
10 | 2696878896 |
11 | 1164355038 |
12 | 633219980 |
13 | 33c962c3a |
14 | 1b825d82c |
15 | 10bb6a366 |
hex | a0bf1b30 |
2696878896 has 80 divisors (see below), whose sum is σ = 7229820000. Its totient is φ = 865234944.
The previous prime is 2696878879. The next prime is 2696878897. The reversal of 2696878896 is 6988786962.
It is a self number, because there is not a number n which added to its sum of digits gives 2696878896.
It is not an unprimeable number, because it can be changed into a prime (2696878897) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 466230 + ... + 471978.
It is an arithmetic number, because the mean of its divisors is an integer number (90372750).
Almost surely, 22696878896 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 2696878896, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3614910000).
2696878896 is an abundant number, since it is smaller than the sum of its proper divisors (4532941104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2696878896 is a wasteful number, since it uses less digits than its factorization.
2696878896 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6126 (or 6120 counting only the distinct ones).
The product of its digits is 125411328, while the sum is 69.
The square root of 2696878896 is about 51931.4827055804. The cubic root of 2696878896 is about 1391.9398920405.
The spelling of 2696878896 in words is "two billion, six hundred ninety-six million, eight hundred seventy-eight thousand, eight hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •