Base | Representation |
---|---|
bin | 1001011100010001… |
… | …11100100001011000 |
3 | 111002021100010221111 |
4 | 10232020330201120 |
5 | 40340140024110 |
6 | 2154555350104 |
7 | 236421223030 |
oct | 45610744130 |
9 | 14067303844 |
10 | 5069064280 |
11 | 217139a025 |
12 | b95752334 |
13 | 62a260527 |
14 | 36131c8c0 |
15 | 1ea049e8a |
hex | 12e23c858 |
5069064280 has 128 divisors (see below), whose sum is σ = 13562640000. Its totient is φ = 1668280320.
The previous prime is 5069064239. The next prime is 5069064281. The reversal of 5069064280 is 824609605.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5069064281) 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, 1467996 + ... + 1471444.
It is an arithmetic number, because the mean of its divisors is an integer number (105958125).
Almost surely, 25069064280 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 5069064280, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6781320000).
5069064280 is an abundant number, since it is smaller than the sum of its proper divisors (8493575720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5069064280 is a wasteful number, since it uses less digits than its factorization.
5069064280 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3677 (or 3673 counting only the distinct ones).
The product of its (nonzero) digits is 103680, while the sum is 40.
The square root of 5069064280 is about 71197.3614679645. The cubic root of 5069064280 is about 1717.8131889537.
The spelling of 5069064280 in words is "five billion, sixty-nine million, sixty-four thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •