Base | Representation |
---|---|
bin | 101110110010110111… |
… | …000100011111111101 |
3 | 11210200200121212000111 |
4 | 232302313010133331 |
5 | 1310400311433203 |
6 | 35025445430021 |
7 | 3426062014012 |
oct | 566267043775 |
9 | 153620555014 |
10 | 50245421053 |
11 | 1a344259573 |
12 | 98a310b311 |
13 | 497986b199 |
14 | 2609177709 |
15 | 14911c226d |
hex | bb2dc47fd |
50245421053 has 4 divisors (see below), whose sum is σ = 50565455740. Its totient is φ = 49925386368.
The previous prime is 50245421033. The next prime is 50245421069. The reversal of 50245421053 is 35012454205.
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 13428637924 + 36816783129 = 115882^2 + 191877^2 .
It is a cyclic number.
It is not a de Polignac number, because 50245421053 - 25 = 50245421021 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 (50245421033) 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, 160017108 + ... + 160017421.
It is an arithmetic number, because the mean of its divisors is an integer number (12641363935).
Almost surely, 250245421053 is an apocalyptic number.
It is an amenable number.
50245421053 is a deficient number, since it is larger than the sum of its proper divisors (320034687).
50245421053 is a wasteful number, since it uses less digits than its factorization.
50245421053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 320034686.
The product of its (nonzero) digits is 24000, while the sum is 31.
Adding to 50245421053 its reverse (35012454205), we get a palindrome (85257875258).
The spelling of 50245421053 in words is "fifty billion, two hundred forty-five million, four hundred twenty-one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •