Base | Representation |
---|---|
bin | 100101000110111010111… |
… | …1100111110111100101100 |
3 | 200001120021002112011021020 |
4 | 1022031311330332330230 |
5 | 1132030003401213400 |
6 | 14502542252134140 |
7 | 1034320234036632 |
oct | 112156574767454 |
9 | 20046232464236 |
10 | 5100105101100 |
11 | 1696a40408679 |
12 | 6a4526a67350 |
13 | 2acc265b22b9 |
14 | 138bbc765352 |
15 | 8c9eacbc2a0 |
hex | 4a375f3ef2c |
5100105101100 has 36 divisors (see below), whose sum is σ = 14756304093384. Its totient is φ = 1360028026880.
The previous prime is 5100105101071. The next prime is 5100105101107. The reversal of 5100105101100 is 11015010015.
It is a super-2 number, since 2×51001051011002 (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 5100105101100.
It is not an unprimeable number, because it can be changed into a prime (5100105101107) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8500174869 + ... + 8500175468.
Almost surely, 25100105101100 is an apocalyptic number.
5100105101100 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5100105101100 is an abundant number, since it is smaller than the sum of its proper divisors (9656198992284).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5100105101100 is a wasteful number, since it uses less digits than its factorization.
5100105101100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17000350354 (or 17000350347 counting only the distinct ones).
The product of its (nonzero) digits is 25, while the sum is 15.
The spelling of 5100105101100 in words is "five trillion, one hundred billion, one hundred five million, one hundred one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •