Base | Representation |
---|---|
bin | 1001100000110111… |
… | …11110011000011000 |
3 | 111011221212022201000 |
4 | 10300123332120120 |
5 | 40430021411224 |
6 | 2202453425000 |
7 | 240366641460 |
oct | 46033763030 |
9 | 14157768630 |
10 | 5107607064 |
11 | 219112486a |
12 | ba663b160 |
13 | 635236a01 |
14 | 3664b2ba0 |
15 | 1ed6100c9 |
hex | 1306fe618 |
5107607064 has 64 divisors (see below), whose sum is σ = 16214630400. Its totient is φ = 1459315872.
The previous prime is 5107607051. The next prime is 5107607081. The reversal of 5107607064 is 4607067015.
5107607064 is a `hidden beast` number, since 510 + 76 + 0 + 70 + 6 + 4 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1687512 + ... + 1690535.
It is an arithmetic number, because the mean of its divisors is an integer number (253353600).
Almost surely, 25107607064 is an apocalyptic number.
5107607064 is a gapful number since it is divisible by the number (54) formed by its first and last digit.
It is an amenable number.
5107607064 is an abundant number, since it is smaller than the sum of its proper divisors (11107023336).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5107607064 is a wasteful number, since it uses less digits than its factorization.
5107607064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3378069 (or 3378059 counting only the distinct ones).
The product of its (nonzero) digits is 35280, while the sum is 36.
The square root of 5107607064 is about 71467.5245408710. The cubic root of 5107607064 is about 1722.1560154386.
It can be divided in two parts, 5107 and 607064, that added together give a triangular number (612171 = T1106).
The spelling of 5107607064 in words is "five billion, one hundred seven million, six hundred seven thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •