Base | Representation |
---|---|
bin | 10110101111011111111011… |
… | …01110100001110011010010 |
3 | 20120001221222222122200222002 |
4 | 23113233331232201303102 |
5 | 23023333112112410200 |
6 | 254210311245314002 |
7 | 13351100216100503 |
oct | 1327577556416322 |
9 | 216057888580862 |
10 | 50010561060050 |
11 | 14a313a5a44898 |
12 | 573846b865902 |
13 | 21b9c8b723b36 |
14 | c4c74a098baa |
15 | 5bad51de7bd5 |
hex | 2d7bfdba1cd2 |
50010561060050 has 24 divisors (see below), whose sum is σ = 93021261982896. Its totient is φ = 20003876378640.
The previous prime is 50010561060043. The next prime is 50010561060067. The reversal of 50010561060050 is 5006016501005.
It is a junction number, because it is equal to n+sod(n) for n = 50010561059995 and 50010561060022.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5788952 + ... + 11555651.
It is an arithmetic number, because the mean of its divisors is an integer number (3875885915954).
Almost surely, 250010561060050 is an apocalyptic number.
50010561060050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
50010561060050 is a deficient number, since it is larger than the sum of its proper divisors (43010700922846).
50010561060050 is a wasteful number, since it uses less digits than its factorization.
50010561060050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17402282 (or 17402277 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 29.
Adding to 50010561060050 its reverse (5006016501005), we get a palindrome (55016577561055).
The spelling of 50010561060050 in words is "fifty trillion, ten billion, five hundred sixty-one million, sixty thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •