Base | Representation |
---|---|
bin | 100101001001011110111… |
… | …0001101001011000110010 |
3 | 200002002110101122211002102 |
4 | 1022102331301221120302 |
5 | 1132122234343243200 |
6 | 14505252123220402 |
7 | 1034603436633002 |
oct | 112227561513062 |
9 | 20062411584072 |
10 | 5105605056050 |
11 | 1699302a51194 |
12 | 6a5600977702 |
13 | 2b05c1bab605 |
14 | 139180daa002 |
15 | 8cc1da7d6d5 |
hex | 4a4bdc69632 |
5105605056050 has 12 divisors (see below), whose sum is σ = 9496425404346. Its totient is φ = 2042242022400.
The previous prime is 5105605056049. The next prime is 5105605056173. The reversal of 5105605056050 is 506505065015.
It can be written as a sum of positive squares in 3 ways, for example, as 2968222459609 + 2137382596441 = 1722853^2 + 1461979^2 .
It is a junction number, because it is equal to n+sod(n) for n = 5105605055995 and 5105605056013.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 51056050511 + ... + 51056050610.
Almost surely, 25105605056050 is an apocalyptic number.
5105605056050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5105605056050 is a deficient number, since it is larger than the sum of its proper divisors (4390820348296).
5105605056050 is a wasteful number, since it uses less digits than its factorization.
5105605056050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102112101133 (or 102112101128 counting only the distinct ones).
The product of its (nonzero) digits is 112500, while the sum is 38.
The spelling of 5105605056050 in words is "five trillion, one hundred five billion, six hundred five million, fifty-six thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •