Base | Representation |
---|---|
bin | 101110100100100100… |
… | …001111110010011101 |
3 | 11210001222100221222012 |
4 | 232210210033302131 |
5 | 1304402413334113 |
6 | 34550001401005 |
7 | 3420120430262 |
oct | 564444176235 |
9 | 153058327865 |
10 | 50005605533 |
11 | 1a230951624 |
12 | 9836939165 |
13 | 493bc83300 |
14 | 25c538d269 |
15 | 147a100aa8 |
hex | ba490fc9d |
50005605533 has 12 divisors (see below), whose sum is σ = 54173811348. Its totient is φ = 46137087360.
The previous prime is 50005605493. The next prime is 50005605557. The reversal of 50005605533 is 33550650005.
It can be written as a sum of positive squares in 6 ways, for example, as 23623075204 + 26382530329 = 153698^2 + 162427^2 .
It is not a de Polignac number, because 50005605533 - 28 = 50005605277 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 50005605533.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50005605233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 291923 + ... + 430383.
It is an arithmetic number, because the mean of its divisors is an integer number (4514484279).
Almost surely, 250005605533 is an apocalyptic number.
It is an amenable number.
50005605533 is a deficient number, since it is larger than the sum of its proper divisors (4168205815).
50005605533 is a wasteful number, since it uses less digits than its factorization.
50005605533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140624 (or 140611 counting only the distinct ones).
The product of its (nonzero) digits is 33750, while the sum is 32.
The spelling of 50005605533 in words is "fifty billion, five million, six hundred five thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •