Base | Representation |
---|---|
bin | 1001100000010111… |
… | …00100010010000000 |
3 | 111011122202210120000 |
4 | 10300023210102000 |
5 | 40422421241411 |
6 | 2202221320000 |
7 | 240315245505 |
oct | 46013442200 |
9 | 14148683500 |
10 | 5103305856 |
11 | 2189757250 |
12 | ba5106000 |
13 | 63438c00c |
14 | 365ab34ac |
15 | 1ed060956 |
hex | 1302e4480 |
5103305856 has 320 divisors, whose sum is σ = 17150443200. Its totient is φ = 1492162560.
The previous prime is 5103305843. The next prime is 5103305861. The reversal of 5103305856 is 6585033015.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 5103305856.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 3306621 + ... + 3308163.
It is an arithmetic number, because the mean of its divisors is an integer number (53595135).
Almost surely, 25103305856 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 5103305856, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8575221600).
5103305856 is an abundant number, since it is smaller than the sum of its proper divisors (12047137344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5103305856 is a wasteful number, since it uses less digits than its factorization.
5103305856 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1609 (or 1588 counting only the distinct ones).
The product of its (nonzero) digits is 54000, while the sum is 36.
The square root of 5103305856 is about 71437.4261574422. The cubic root of 5103305856 is about 1721.6724601325.
The spelling of 5103305856 in words is "five billion, one hundred three million, three hundred five thousand, eight hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.187 sec. • engine limits •