Base | Representation |
---|---|
bin | 1001100000000001… |
… | …11000011110101000 |
3 | 111011110111111111121 |
4 | 10300000320132220 |
5 | 40421212130000 |
6 | 2202041305024 |
7 | 240252401653 |
oct | 46000703650 |
9 | 14143444447 |
10 | 5100505000 |
11 | 2188113998 |
12 | ba4195174 |
13 | 63391b1c6 |
14 | 36558489a |
15 | 1ecbaab1a |
hex | 1300387a8 |
5100505000 has 40 divisors (see below), whose sum is σ = 11950494930. Its totient is φ = 2040200000.
The previous prime is 5100504977. The next prime is 5100505021. The reversal of 5100505000 is 5050015.
It can be written as a sum of positive squares in 5 ways, for example, as 1174981284 + 3925523716 = 34278^2 + 62654^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 505051 + ... + 515050.
Almost surely, 25100505000 is an apocalyptic number.
5100505000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5100505000 is an abundant number, since it is smaller than the sum of its proper divisors (6849989930).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5100505000 is a wasteful number, since it uses less digits than its factorization.
5100505000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1020127 (or 1020108 counting only the distinct ones).
The product of its (nonzero) digits is 125, while the sum is 16.
The square root of 5100505000 is about 71417.8199051189. The cubic root of 5100505000 is about 1721.3574330220.
Adding to 5100505000 its reverse (5050015), we get a palindrome (5105555015).
It can be divided in two parts, 510050 and 5000, that multiplied together give a square (2550250000 = 505002).
The spelling of 5100505000 in words is "five billion, one hundred million, five hundred five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •