Base | Representation |
---|---|
bin | 101110100100111001… |
… | …010000011001011111 |
3 | 11210002100201202212111 |
4 | 232210321100121133 |
5 | 1304410321104210 |
6 | 34550315414451 |
7 | 3420215306221 |
oct | 564471203137 |
9 | 153070652774 |
10 | 50011113055 |
11 | 1a233a734a2 |
12 | 9838754427 |
13 | 49401610b7 |
14 | 25c5dc4411 |
15 | 147a83c88a |
hex | ba4e5065f |
50011113055 has 16 divisors (see below), whose sum is σ = 63189803520. Its totient is φ = 37892436768.
The previous prime is 50011112959. The next prime is 50011113067. The reversal of 50011113055 is 55031111005.
It is a cyclic number.
It is not a de Polignac number, because 50011113055 - 27 = 50011112927 is a prime.
It is a super-2 number, since 2×500111130552 (a number of 22 digits) contains 22 as substring.
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 15 ways as a sum of consecutive naturals, for example, 271534 + ... + 416836.
It is an arithmetic number, because the mean of its divisors is an integer number (3949362720).
Almost surely, 250011113055 is an apocalyptic number.
50011113055 is a deficient number, since it is larger than the sum of its proper divisors (13178690465).
50011113055 is a wasteful number, since it uses less digits than its factorization.
50011113055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148950.
The product of its (nonzero) digits is 375, while the sum is 22.
The spelling of 50011113055 in words is "fifty billion, eleven million, one hundred thirteen thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •