Base | Representation |
---|---|
bin | 1001011101100010… |
… | …11011111101000010 |
3 | 111010000022102022100 |
4 | 10232301123331002 |
5 | 40400344210121 |
6 | 2200015051230 |
7 | 236610362100 |
oct | 45661337502 |
9 | 14100272270 |
10 | 5079678786 |
11 | 2177389946 |
12 | b99210b16 |
13 | 62c5089c0 |
14 | 3628c2c70 |
15 | 1eae45026 |
hex | 12ec5bf42 |
5079678786 has 216 divisors, whose sum is σ = 14277715452. Its totient is φ = 1293667200.
The previous prime is 5079678763. The next prime is 5079678833. The reversal of 5079678786 is 6878769705.
It can be written as a sum of positive squares in 2 ways, for example, as 4672406025 + 407272761 = 68355^2 + 20181^2 .
It is a Harshad number since it is a multiple of its sum of digits (63).
It is an unprimeable number.
It is a polite number, since it can be written in 107 ways as a sum of consecutive naturals, for example, 11018596 + ... + 11019056.
Almost surely, 25079678786 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5079678786, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7138857726).
5079678786 is an abundant number, since it is smaller than the sum of its proper divisors (9198036666).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5079678786 is a wasteful number, since it uses less digits than its factorization.
5079678786 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 558 (or 517 counting only the distinct ones).
The product of its (nonzero) digits is 35562240, while the sum is 63.
The square root of 5079678786 is about 71271.8653186515. The cubic root of 5079678786 is about 1719.0113736789.
It can be divided in two parts, 5079 and 678786, that added together give a triangular number (683865 = T1169).
The spelling of 5079678786 in words is "five billion, seventy-nine million, six hundred seventy-eight thousand, seven hundred eighty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •