Base | Representation |
---|---|
bin | 101110100110010101… |
… | …001001000000010101 |
3 | 11210011001001111222100 |
4 | 232212111021000111 |
5 | 1304433002400041 |
6 | 34552535552313 |
7 | 3420630116502 |
oct | 564625110025 |
9 | 153131044870 |
10 | 50035200021 |
11 | 1a246625384 |
12 | 984482b699 |
13 | 4945145841 |
14 | 25c92944a9 |
15 | 147c9e96b6 |
hex | ba6549015 |
50035200021 has 6 divisors (see below), whose sum is σ = 72273066710. Its totient is φ = 33356800008.
The previous prime is 50035199947. The next prime is 50035200043. The reversal of 50035200021 is 12000253005.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 50003220996 + 31979025 = 223614^2 + 5655^2 .
It is not a de Polignac number, because 50035200021 - 211 = 50035197973 is a prime.
It is a super-2 number, since 2×500352000212 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 50035199967 and 50035200003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50035200521) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2779733326 + ... + 2779733343.
Almost surely, 250035200021 is an apocalyptic number.
It is an amenable number.
50035200021 is a deficient number, since it is larger than the sum of its proper divisors (22237866689).
50035200021 is a wasteful number, since it uses less digits than its factorization.
50035200021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5559466675 (or 5559466672 counting only the distinct ones).
The product of its (nonzero) digits is 300, while the sum is 18.
Adding to 50035200021 its reverse (12000253005), we get a palindrome (62035453026).
The spelling of 50035200021 in words is "fifty billion, thirty-five million, two hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •