Base | Representation |
---|---|
bin | 100101001100010001100… |
… | …0110101110111110000011 |
3 | 200002122221012022001211021 |
4 | 1022120203012232332003 |
5 | 1132222024103100201 |
6 | 14512123040530311 |
7 | 1035205133351425 |
oct | 112304306567603 |
9 | 20078835261737 |
10 | 5111600050051 |
11 | 16a08a9a72990 |
12 | 6a67b4620997 |
13 | 2b1038c13941 |
14 | 13958d274815 |
15 | 8ce70027ea1 |
hex | 4a6231aef83 |
5111600050051 has 24 divisors (see below), whose sum is σ = 5842745009136. Its totient is φ = 4434602135040.
The previous prime is 5111600050033. The next prime is 5111600050061. The reversal of 5111600050051 is 1500500061115.
It is not a de Polignac number, because 5111600050051 - 29 = 5111600049539 is a prime.
It is a super-2 number, since 2×51116000500512 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5111600049998 and 5111600050025.
It is not an unprimeable number, because it can be changed into a prime (5111600050061) 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, 1505271 + ... + 3533983.
It is an arithmetic number, because the mean of its divisors is an integer number (243447708714).
Almost surely, 25111600050051 is an apocalyptic number.
5111600050051 is a deficient number, since it is larger than the sum of its proper divisors (731144959085).
5111600050051 is a wasteful number, since it uses less digits than its factorization.
5111600050051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2029203 (or 2029180 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 25.
The spelling of 5111600050051 in words is "five trillion, one hundred eleven billion, six hundred million, fifty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •