Base | Representation |
---|---|
bin | 1001010111001110… |
… | …01010110101010000 |
3 | 110222022112120010110 |
4 | 10223213022311100 |
5 | 40243310434233 |
6 | 2150442401320 |
7 | 235364603334 |
oct | 45347126520 |
9 | 13868476113 |
10 | 5026655568 |
11 | 214a463800 |
12 | b83500240 |
13 | 62153250c |
14 | 35983d7c4 |
15 | 1e646e663 |
hex | 12b9cad50 |
5026655568 has 120 divisors (see below), whose sum is σ = 14516258400. Its totient is φ = 1497309440.
The previous prime is 5026655563. The next prime is 5026655633. The reversal of 5026655568 is 8655566205.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5026655563) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 335338 + ... + 350006.
It is an arithmetic number, because the mean of its divisors is an integer number (120968820).
Almost surely, 25026655568 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 5026655568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7258129200).
5026655568 is an abundant number, since it is smaller than the sum of its proper divisors (9489602832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5026655568 is a wasteful number, since it uses less digits than its factorization.
5026655568 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14761 (or 14744 counting only the distinct ones).
The product of its (nonzero) digits is 2160000, while the sum is 48.
The square root of 5026655568 is about 70898.9109084195. The cubic root of 5026655568 is about 1713.0092547506.
The spelling of 5026655568 in words is "five billion, twenty-six million, six hundred fifty-five thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •