Base | Representation |
---|---|
bin | 101110100101101111… |
… | …000111011010001101 |
3 | 11210010100022002102212 |
4 | 232211233013122031 |
5 | 1304422424411023 |
6 | 34551542200205 |
7 | 3420446312321 |
oct | 564557073215 |
9 | 153110262385 |
10 | 50025232013 |
11 | 1a240a37259 |
12 | 9841423065 |
13 | 4943065703 |
14 | 25c7c1b981 |
15 | 147bbcae78 |
hex | ba5bc768d |
50025232013 has 4 divisors (see below), whose sum is σ = 50025884220. Its totient is φ = 50024579808.
The previous prime is 50025232009. The next prime is 50025232021. The reversal of 50025232013 is 31023252005.
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 26222296489 + 23802935524 = 161933^2 + 154282^2 .
It is a cyclic number.
It is not a de Polignac number, because 50025232013 - 22 = 50025232009 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 50025232013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50025232073) 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, 192920 + ... + 370497.
It is an arithmetic number, because the mean of its divisors is an integer number (12506471055).
Almost surely, 250025232013 is an apocalyptic number.
It is an amenable number.
50025232013 is a deficient number, since it is larger than the sum of its proper divisors (652207).
50025232013 is an equidigital number, since it uses as much as digits as its factorization.
50025232013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 652206.
The product of its (nonzero) digits is 1800, while the sum is 23.
Adding to 50025232013 its reverse (31023252005), we get a palindrome (81048484018).
The spelling of 50025232013 in words is "fifty billion, twenty-five million, two hundred thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •