Base | Representation |
---|---|
bin | 100101001001101100010… |
… | …0110011110000110001010 |
3 | 200002010121202111222111010 |
4 | 1022103120212132012022 |
5 | 1132124200102023200 |
6 | 14505404521344350 |
7 | 1034620543221465 |
oct | 112233046360612 |
9 | 20063552458433 |
10 | 5106055111050 |
11 | 1699513aa5173 |
12 | 6a57076380b6 |
13 | 2b06641c734a |
14 | 1391c4a802dc |
15 | 8cc4832d150 |
hex | 4a4d899e18a |
5106055111050 has 24 divisors (see below), whose sum is σ = 12663016675776. Its totient is φ = 1361614696240.
The previous prime is 5106055111037. The next prime is 5106055111081. The reversal of 5106055111050 is 501115506015.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 5106055110999 and 5106055111017.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 17020183554 + ... + 17020183853.
It is an arithmetic number, because the mean of its divisors is an integer number (527625694824).
Almost surely, 25106055111050 is an apocalyptic number.
5106055111050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5106055111050 is an abundant number, since it is smaller than the sum of its proper divisors (7556961564726).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5106055111050 is a wasteful number, since it uses less digits than its factorization.
5106055111050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34040367422 (or 34040367417 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 30.
The spelling of 5106055111050 in words is "five trillion, one hundred six billion, fifty-five million, one hundred eleven thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •