Base | Representation |
---|---|
bin | 101110100111100000… |
… | …111001111001110110 |
3 | 11210012102102120021020 |
4 | 232213200321321312 |
5 | 1310003043423420 |
6 | 34554525402010 |
7 | 3421260666525 |
oct | 564740717166 |
9 | 153172376236 |
10 | 50055061110 |
11 | 1a2568602aa |
12 | 984b409306 |
13 | 49492aa972 |
14 | 25cbb844bc |
15 | 147e61e340 |
hex | ba7839e76 |
50055061110 has 64 divisors (see below), whose sum is σ = 124403947200. Its totient is φ = 12874330112.
The previous prime is 50055061097. The next prime is 50055061123. The reversal of 50055061110 is 1116055005.
It is an interprime number because it is at equal distance from previous prime (50055061097) and next prime (50055061123).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 820546 + ... + 879434.
It is an arithmetic number, because the mean of its divisors is an integer number (1943811675).
Almost surely, 250055061110 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 50055061110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (62201973600).
50055061110 is an abundant number, since it is smaller than the sum of its proper divisors (74348886090).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50055061110 is a wasteful number, since it uses less digits than its factorization.
50055061110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59905.
The product of its (nonzero) digits is 750, while the sum is 24.
The spelling of 50055061110 in words is "fifty billion, fifty-five million, sixty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •