Base | Representation |
---|---|
bin | 1001101010010110… |
… | …00110101000110000 |
3 | 111101111101111001200 |
4 | 10311023012220300 |
5 | 41110342224022 |
6 | 2214412531200 |
7 | 242353241361 |
oct | 46513065060 |
9 | 14344344050 |
10 | 5187070512 |
11 | 2221a69938 |
12 | 1009180b00 |
13 | 648839ac0 |
14 | 372c79b68 |
15 | 2055a9bac |
hex | 1352c6a30 |
5187070512 has 120 divisors (see below), whose sum is σ = 15652216944. Its totient is φ = 1594086912.
The previous prime is 5187070477. The next prime is 5187070543. The reversal of 5187070512 is 2150707815.
5187070512 is a `hidden beast` number, since 5 + 1 + 8 + 70 + 70 + 512 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2719063 + ... + 2720969.
Almost surely, 25187070512 is an apocalyptic number.
5187070512 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5187070512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7826108472).
5187070512 is an abundant number, since it is smaller than the sum of its proper divisors (10465146432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5187070512 is a wasteful number, since it uses less digits than its factorization.
5187070512 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3387 (or 3378 counting only the distinct ones).
The product of its (nonzero) digits is 19600, while the sum is 36.
The square root of 5187070512 is about 72021.3198435019. The cubic root of 5187070512 is about 1731.0411179005.
The spelling of 5187070512 in words is "five billion, one hundred eighty-seven million, seventy thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •