Base | Representation |
---|---|
bin | 10110110010011010010101… |
… | …01100111101000111000000 |
3 | 20120102112022102201001001000 |
4 | 23121031022230331013000 |
5 | 23032003041001203211 |
6 | 254324301514412000 |
7 | 13361242202253363 |
oct | 1331151254750700 |
9 | 216375272631030 |
10 | 50110636741056 |
11 | 14a6a890071181 |
12 | 575393aa31000 |
13 | 21c6549b10b28 |
14 | c535211ba0da |
15 | 5bd75cad1656 |
hex | 2d934ab3d1c0 |
50110636741056 has 224 divisors, whose sum is σ = 150462492226560. Its totient is φ = 16346834380800.
The previous prime is 50110636741037. The next prime is 50110636741073. The reversal of 50110636741056 is 65014763601105.
50110636741056 is a `hidden beast` number, since 5 + 0 + 1 + 1 + 0 + 636 + 7 + 4 + 1 + 0 + 5 + 6 = 666.
It is a super-2 number, since 2×501106367410562 (a number of 28 digits) contains 22 as substring.
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, 1971992991 + ... + 1972018401.
Almost surely, 250110636741056 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 50110636741056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (75231246113280).
50110636741056 is an abundant number, since it is smaller than the sum of its proper divisors (100351855485504).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50110636741056 is a wasteful number, since it uses less digits than its factorization.
50110636741056 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49760 (or 49744 counting only the distinct ones).
The product of its (nonzero) digits is 453600, while the sum is 45.
The spelling of 50110636741056 in words is "fifty trillion, one hundred ten billion, six hundred thirty-six million, seven hundred forty-one thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •