Base | Representation |
---|---|
bin | 100101000110111010111… |
… | …1100101000111110011100 |
3 | 200001120021002100120210220 |
4 | 1022031311330220332130 |
5 | 1132030003340323400 |
6 | 14502542250201340 |
7 | 1034320233213351 |
oct | 112156574507634 |
9 | 20046232316726 |
10 | 5100105011100 |
11 | 1696a40356aa0 |
12 | 6a4526a23250 |
13 | 2acc26580348 |
14 | 138bbc740628 |
15 | 8c9eaca07a0 |
hex | 4a375f28f9c |
5100105011100 has 72 divisors (see below), whose sum is σ = 16097786009088. Its totient is φ = 1236389092800.
The previous prime is 5100105011087. The next prime is 5100105011101. The reversal of 5100105011100 is 11105010015.
It is a super-2 number, since 2×51001050111002 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 5100105011100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5100105011101) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 772739884 + ... + 772746483.
Almost surely, 25100105011100 is an apocalyptic number.
5100105011100 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5100105011100 is an abundant number, since it is smaller than the sum of its proper divisors (10997680997988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5100105011100 is a wasteful number, since it uses less digits than its factorization.
5100105011100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1545486395 (or 1545486388 counting only the distinct ones).
The product of its (nonzero) digits is 25, while the sum is 15.
The spelling of 5100105011100 in words is "five trillion, one hundred billion, one hundred five million, eleven thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •