Base | Representation |
---|---|
bin | 110011110010111110… |
… | …011001001110000010 |
3 | 12022112222102001222120 |
4 | 303302332121032002 |
5 | 1402400202100200 |
6 | 41314420545110 |
7 | 4006134424341 |
oct | 636276311602 |
9 | 168488361876 |
10 | 55616050050 |
11 | 2164a8a0630 |
12 | a941852196 |
13 | 5324426772 |
14 | 2998555b58 |
15 | 16a79399a0 |
hex | cf2f99382 |
55616050050 has 48 divisors (see below), whose sum is σ = 150466699872. Its totient is φ = 13482678400.
The previous prime is 55616050003. The next prime is 55616050081. The reversal of 55616050050 is 5005061655.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 55616049993 and 55616050020.
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, 16851699 + ... + 16854998.
It is an arithmetic number, because the mean of its divisors is an integer number (3134722914).
Almost surely, 255616050050 is an apocalyptic number.
55616050050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
55616050050 is an abundant number, since it is smaller than the sum of its proper divisors (94850649822).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55616050050 is a wasteful number, since it uses less digits than its factorization.
55616050050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33706723 (or 33706718 counting only the distinct ones).
The product of its (nonzero) digits is 22500, while the sum is 33.
The spelling of 55616050050 in words is "fifty-five billion, six hundred sixteen million, fifty thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •