Base | Representation |
---|---|
bin | 10110110000001001000111… |
… | …11001000110000001100110 |
3 | 20120011002002020012020111212 |
4 | 23120010203321012001212 |
5 | 23024213410101404200 |
6 | 254224405533431422 |
7 | 13352512233511001 |
oct | 1330044371060146 |
9 | 216132066166455 |
10 | 50032676200550 |
11 | 14a3a81440320a |
12 | 574080203b572 |
13 | 21bc0a438aba4 |
14 | c4d84724c538 |
15 | 5bb6e86bc035 |
hex | 2d8123e46066 |
50032676200550 has 48 divisors (see below), whose sum is σ = 97292572519680. Its totient is φ = 19106334577440.
The previous prime is 50032676200547. The next prime is 50032676200571. The reversal of 50032676200550 is 5500267623005.
It is a junction number, because it is equal to n+sod(n) for n = 50032676200498 and 50032676200507.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 40991930 + ... + 42194829.
It is an arithmetic number, because the mean of its divisors is an integer number (2026928594160).
Almost surely, 250032676200550 is an apocalyptic number.
50032676200550 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
50032676200550 is a deficient number, since it is larger than the sum of its proper divisors (47259896319130).
50032676200550 is a wasteful number, since it uses less digits than its factorization.
50032676200550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83187317 (or 83187312 counting only the distinct ones).
The product of its (nonzero) digits is 378000, while the sum is 41.
The spelling of 50032676200550 in words is "fifty trillion, thirty-two billion, six hundred seventy-six million, two hundred thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •