Base | Representation |
---|---|
bin | 101110100100001111… |
… | …110100110011111001 |
3 | 11210001121021222111212 |
4 | 232210033310303321 |
5 | 1304400031032103 |
6 | 34545250532505 |
7 | 3420024062615 |
oct | 564417646371 |
9 | 153047258455 |
10 | 50000252153 |
11 | 1a228925545 |
12 | 9834b97135 |
13 | 493ab2a727 |
14 | 25c4798345 |
15 | 14798e47d8 |
hex | ba43f4cf9 |
50000252153 has 4 divisors (see below), whose sum is σ = 50685187188. Its totient is φ = 49315317120.
The previous prime is 50000252111. The next prime is 50000252167. The reversal of 50000252153 is 35125200005.
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 40582908304 + 9417343849 = 201452^2 + 97043^2 .
It is a cyclic number.
It is not a de Polignac number, because 50000252153 - 28 = 50000251897 is a prime.
It is a super-2 number, since 2×500002521532 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50000252173) 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, 342467408 + ... + 342467553.
It is an arithmetic number, because the mean of its divisors is an integer number (12671296797).
Almost surely, 250000252153 is an apocalyptic number.
It is an amenable number.
50000252153 is a deficient number, since it is larger than the sum of its proper divisors (684935035).
50000252153 is an equidigital number, since it uses as much as digits as its factorization.
50000252153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 684935034.
The product of its (nonzero) digits is 1500, while the sum is 23.
Adding to 50000252153 its reverse (35125200005), we get a palindrome (85125452158).
The spelling of 50000252153 in words is "fifty billion, two hundred fifty-two thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •