Base | Representation |
---|---|
bin | 1010000000110101… |
… | …1010001011011000 |
3 | 20221022200221000000 |
4 | 2200031122023120 |
5 | 21001043312111 |
6 | 1122414213000 |
7 | 123415341453 |
oct | 24015321330 |
9 | 6838627000 |
10 | 2687869656 |
11 | 115a26128a |
12 | 6301b4160 |
13 | 33ab2a324 |
14 | 1b6d9649a |
15 | 10ae8ac56 |
hex | a035a2d8 |
2687869656 has 224 divisors, whose sum is σ = 8058470400. Its totient is φ = 837708480.
The previous prime is 2687869651. The next prime is 2687869733. The reversal of 2687869656 is 6569687862.
It is a junction number, because it is equal to n+sod(n) for n = 2687869593 and 2687869602.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2687869651) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 14072521 + ... + 14072711.
Almost surely, 22687869656 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 2687869656, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4029235200).
2687869656 is an abundant number, since it is smaller than the sum of its proper divisors (5370600744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2687869656 is a wasteful number, since it uses less digits than its factorization.
2687869656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 361 (or 342 counting only the distinct ones).
The product of its digits is 52254720, while the sum is 63.
The square root of 2687869656 is about 51844.6685397833. The cubic root of 2687869656 is about 1390.3881834238.
The spelling of 2687869656 in words is "two billion, six hundred eighty-seven million, eight hundred sixty-nine thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •