Base | Representation |
---|---|
bin | 100101000111000100100… |
… | …0011101110011101110100 |
3 | 200001121002102200000002002 |
4 | 1022032021003232131310 |
5 | 1132031132430320300 |
6 | 14503034142234432 |
7 | 1034331205403063 |
oct | 112161103563564 |
9 | 20047072600062 |
10 | 5100425635700 |
11 | 1697095337aaa |
12 | 6a45b6285a18 |
13 | 2acc77b1c945 |
14 | 138c0d1621da |
15 | 8ca18ed55d5 |
hex | 4a3890ee774 |
5100425635700 has 36 divisors (see below), whose sum is σ = 11068112181420. Its totient is φ = 2040135498240.
The previous prime is 5100425635699. The next prime is 5100425635717. The reversal of 5100425635700 is 75365240015.
It is a happy number.
It can be written as a sum of positive squares in 6 ways, for example, as 107980588816 + 4992445046884 = 328604^2 + 2234378^2 .
It is a super-2 number, since 2×51004256357002 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5928506 + ... + 6734094.
It is an arithmetic number, because the mean of its divisors is an integer number (307447560595).
Almost surely, 25100425635700 is an apocalyptic number.
5100425635700 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5100425635700 is an abundant number, since it is smaller than the sum of its proper divisors (5967686545720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5100425635700 is a wasteful number, since it uses less digits than its factorization.
5100425635700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 868916 (or 868909 counting only the distinct ones).
The product of its (nonzero) digits is 126000, while the sum is 38.
The spelling of 5100425635700 in words is "five trillion, one hundred billion, four hundred twenty-five million, six hundred thirty-five thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •