Base | Representation |
---|---|
bin | 101111011011000100… |
… | …110010011110011101 |
3 | 11212102201011101121121 |
4 | 233123010302132131 |
5 | 1313241021342020 |
6 | 35220430330541 |
7 | 3451563521125 |
oct | 573304623635 |
9 | 155381141547 |
10 | 50920105885 |
11 | 1a660088240 |
12 | 9a51059a51 |
13 | 4a56585a8c |
14 | 2670a01c85 |
15 | 14d0543baa |
hex | bdb13279d |
50920105885 has 32 divisors (see below), whose sum is σ = 67197485952. Its totient is φ = 36734100480.
The previous prime is 50920105879. The next prime is 50920105897. The reversal of 50920105885 is 58850102905.
It is not a de Polignac number, because 50920105885 - 27 = 50920105757 is a prime.
It is a super-2 number, since 2×509201058852 (a number of 22 digits) contains 22 as substring.
It is a Duffinian 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, 17909274 + ... + 17912116.
It is an arithmetic number, because the mean of its divisors is an integer number (2099921436).
Almost surely, 250920105885 is an apocalyptic number.
50920105885 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
50920105885 is a deficient number, since it is larger than the sum of its proper divisors (16277380067).
50920105885 is a wasteful number, since it uses less digits than its factorization.
50920105885 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5373.
The product of its (nonzero) digits is 144000, while the sum is 43.
The spelling of 50920105885 in words is "fifty billion, nine hundred twenty million, one hundred five thousand, eight hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •