Base | Representation |
---|---|
bin | 101110110000110010… |
… | …000011110100101100 |
3 | 11210121021000101020000 |
4 | 232300302003310230 |
5 | 1310312400200012 |
6 | 35022202224300 |
7 | 3425156442165 |
oct | 566062036454 |
9 | 153537011200 |
10 | 50210553132 |
11 | 1a326603803 |
12 | 98934b5090 |
13 | 497258058c |
14 | 260469c76c |
15 | 148d0d5ddc |
hex | bb0c83d2c |
50210553132 has 60 divisors (see below), whose sum is σ = 131282228616. Its totient is φ = 16734055680.
The previous prime is 50210553101. The next prime is 50210553157. The reversal of 50210553132 is 23135501205.
It is a happy number.
50210553132 is a `hidden beast` number, since 502 + 105 + 53 + 1 + 3 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 50210553096 and 50210553105.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 3038332 + ... + 3054812.
Almost surely, 250210553132 is an apocalyptic number.
It is an amenable number.
50210553132 is an abundant number, since it is smaller than the sum of its proper divisors (81071675484).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50210553132 is a wasteful number, since it uses less digits than its factorization.
50210553132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25900 (or 25889 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 27.
The spelling of 50210553132 in words is "fifty billion, two hundred ten million, five hundred fifty-three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •