Base | Representation |
---|---|
bin | 10110111111001101101111… |
… | …11100001011000011001001 |
3 | 20121222120211011121111221202 |
4 | 23133212313330023003021 |
5 | 23111210014331023144 |
6 | 255302334353313545 |
7 | 13435104622226321 |
oct | 1337466774130311 |
9 | 217876734544852 |
10 | 50550556111049 |
11 | 1511a409090045 |
12 | 5805052b658b5 |
13 | 2228b878b0657 |
14 | c6a934d5c281 |
15 | 5c9e08d8664e |
hex | 2df9b7f0b0c9 |
50550556111049 has 4 divisors (see below), whose sum is σ = 50564148627840. Its totient is φ = 50536963594260.
The previous prime is 50550556111039. The next prime is 50550556111057. The reversal of 50550556111049 is 94011165505505.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-50550556111049 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50550556110994 and 50550556111012.
It is not an unprimeable number, because it can be changed into a prime (50550556111039) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6796252817 + ... + 6796260254.
It is an arithmetic number, because the mean of its divisors is an integer number (12641037156960).
Almost surely, 250550556111049 is an apocalyptic number.
It is an amenable number.
50550556111049 is a deficient number, since it is larger than the sum of its proper divisors (13592516791).
50550556111049 is a wasteful number, since it uses less digits than its factorization.
50550556111049 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13592516790.
The product of its (nonzero) digits is 675000, while the sum is 47.
The spelling of 50550556111049 in words is "fifty trillion, five hundred fifty billion, five hundred fifty-six million, one hundred eleven thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •