Base | Representation |
---|---|
bin | 101110100111011001… |
… | …001111101001111101 |
3 | 11210012021122112201202 |
4 | 232213121033221331 |
5 | 1310002040144203 |
6 | 34554414345245 |
7 | 3421234634243 |
oct | 564731175175 |
9 | 153167575652 |
10 | 50053053053 |
11 | 1a255709653 |
12 | 984a7bb225 |
13 | 4948a56973 |
14 | 25cb7c0793 |
15 | 147e374388 |
hex | ba764fa7d |
50053053053 has 4 divisors (see below), whose sum is σ = 50738711388. Its totient is φ = 49367394720.
The previous prime is 50053053049. The next prime is 50053053067. The reversal of 50053053053 is 35035035005.
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 30799548004 + 19253505049 = 175498^2 + 138757^2 .
It is a cyclic number.
It is not a de Polignac number, because 50053053053 - 22 = 50053053049 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50053053553) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 342829058 + ... + 342829203.
It is an arithmetic number, because the mean of its divisors is an integer number (12684677847).
Almost surely, 250053053053 is an apocalyptic number.
It is an amenable number.
50053053053 is a deficient number, since it is larger than the sum of its proper divisors (685658335).
50053053053 is an equidigital number, since it uses as much as digits as its factorization.
50053053053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 685658334.
The product of its (nonzero) digits is 16875, while the sum is 29.
Adding to 50053053053 its reverse (35035035005), we get a palindrome (85088088058).
The spelling of 50053053053 in words is "fifty billion, fifty-three million, fifty-three thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •