Base | Representation |
---|---|
bin | 11001011111010001011101… |
… | …11101001101100011101010 |
3 | 21100110100010121101221012022 |
4 | 30233220232331031203222 |
5 | 24321311111404323200 |
6 | 315113022053144442 |
7 | 14543326000460402 |
oct | 1457505675154352 |
9 | 240410117357168 |
10 | 56050111011050 |
11 | 1694a79a495862 |
12 | 6352a7892b122 |
13 | 253766c8200b0 |
14 | dbaba8783802 |
15 | 672ed30b9885 |
hex | 32fa2ef4d8ea |
56050111011050 has 48 divisors (see below), whose sum is σ = 112281295620480. Its totient is φ = 20693838191040.
The previous prime is 56050111011017. The next prime is 56050111011073. The reversal of 56050111011050 is 5011011105065.
It is a super-2 number, since 2×560501110110502 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (26).
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5190371 + ... + 11791529.
It is an arithmetic number, because the mean of its divisors is an integer number (2339193658760).
Almost surely, 256050111011050 is an apocalyptic number.
56050111011050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
56050111011050 is an abundant number, since it is smaller than the sum of its proper divisors (56231184609430).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56050111011050 is a wasteful number, since it uses less digits than its factorization.
56050111011050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6614247 (or 6614242 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 26.
The spelling of 56050111011050 in words is "fifty-six trillion, fifty billion, one hundred eleven million, eleven thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •