Base | Representation |
---|---|
bin | 101111000011101011… |
… | …010100011000011101 |
3 | 11211102100111122100211 |
4 | 233003223110120131 |
5 | 1311440023144203 |
6 | 35113444452421 |
7 | 3436056054205 |
oct | 570353243035 |
9 | 154370448324 |
10 | 50527553053 |
11 | 1a47953950a |
12 | 99616aa111 |
13 | 49c31510b3 |
14 | 2634819405 |
15 | 14aad51c6d |
hex | bc3ad461d |
50527553053 has 4 divisors (see below), whose sum is σ = 51219711388. Its totient is φ = 49835394720.
The previous prime is 50527553047. The next prime is 50527553057. The reversal of 50527553053 is 35035572505.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 31165665444 + 19361887609 = 176538^2 + 139147^2 .
It is a de Polignac number, because none of the positive numbers 2k-50527553053 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50527552997 and 50527553015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50527553057) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 346079058 + ... + 346079203.
It is an arithmetic number, because the mean of its divisors is an integer number (12804927847).
Almost surely, 250527553053 is an apocalyptic number.
It is an amenable number.
50527553053 is a deficient number, since it is larger than the sum of its proper divisors (692158335).
50527553053 is an equidigital number, since it uses as much as digits as its factorization.
50527553053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 692158334.
The product of its (nonzero) digits is 393750, while the sum is 40.
The spelling of 50527553053 in words is "fifty billion, five hundred twenty-seven million, five hundred fifty-three thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •