Base | Representation |
---|---|
bin | 1001100011001100… |
… | …10000000011010100 |
3 | 111020022111112221111 |
4 | 10301212100003110 |
5 | 41000012444400 |
6 | 2204431024404 |
7 | 241024305364 |
oct | 46146200324 |
9 | 14208445844 |
10 | 5127078100 |
11 | 21a1113731 |
12 | bb106b104 |
13 | 639293431 |
14 | 368d009a4 |
15 | 2001a93ba |
hex | 1319900d4 |
5127078100 has 18 divisors (see below), whose sum is σ = 11125759694. Its totient is φ = 2050831200.
The previous prime is 5127078083. The next prime is 5127078101. The reversal of 5127078100 is 18707215.
It is a happy number.
It can be written as a sum of positive squares in 3 ways, for example, as 994645444 + 4132432656 = 31538^2 + 64284^2 .
It is a super-3 number, since 3×51270781003 (a number of 30 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5127078101) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 25635291 + ... + 25635490.
Almost surely, 25127078100 is an apocalyptic number.
5127078100 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5127078100 is an abundant number, since it is smaller than the sum of its proper divisors (5998681594).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5127078100 is a wasteful number, since it uses less digits than its factorization.
5127078100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51270795 (or 51270788 counting only the distinct ones).
The product of its (nonzero) digits is 3920, while the sum is 31.
The square root of 5127078100 is about 71603.6179253535. The cubic root of 5127078100 is about 1724.3416209048.
The spelling of 5127078100 in words is "five billion, one hundred twenty-seven million, seventy-eight thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •