Base | Representation |
---|---|
bin | 1010000001001111… |
… | …0101111000000000 |
3 | 20221102212121012000 |
4 | 2200103311320000 |
5 | 21002011242333 |
6 | 1122514304000 |
7 | 123435564021 |
oct | 24023657000 |
9 | 6842777160 |
10 | 2689555968 |
11 | 1160203230 |
12 | 630888000 |
13 | 33b29aa48 |
14 | 1b72b4c48 |
15 | 10b1c0713 |
hex | a04f5e00 |
2689555968 has 320 divisors, whose sum is σ = 9074419200. Its totient is φ = 778567680.
The previous prime is 2689555951. The next prime is 2689555969. The reversal of 2689555968 is 8695559862.
It is a super-2 number, since 2×26895559682 = 14467422610008834048, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2689555969) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3497088 + ... + 3497856.
It is an arithmetic number, because the mean of its divisors is an integer number (28357560).
Almost surely, 22689555968 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 2689555968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4537209600).
2689555968 is an abundant number, since it is smaller than the sum of its proper divisors (6384863232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2689555968 is a wasteful number, since it uses less digits than its factorization.
2689555968 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 830 (or 808 counting only the distinct ones).
The product of its digits is 46656000, while the sum is 63.
The square root of 2689555968 is about 51860.9291085302. The cubic root of 2689555968 is about 1390.6788892523.
The spelling of 2689555968 in words is "two billion, six hundred eighty-nine million, five hundred fifty-five thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •