Base | Representation |
---|---|
bin | 101000110100110111111… |
… | …1101001101010110111010 |
3 | 201212102020121010101000222 |
4 | 1101221233331031112322 |
5 | 1213413021013330200 |
6 | 15533412322300042 |
7 | 1116250266461351 |
oct | 121515775152672 |
9 | 21772217111028 |
10 | 5611105605050 |
11 | 1873724918550 |
12 | 767577ab7622 |
13 | 3191817a2bba |
14 | 15581694a998 |
15 | 9ae5753dd85 |
hex | 51a6ff4d5ba |
5611105605050 has 24 divisors (see below), whose sum is σ = 11385443374272. Its totient is φ = 2040402038000.
The previous prime is 5611105605037. The next prime is 5611105605059. The reversal of 5611105605050 is 505065011165.
It is a super-2 number, since 2×56111056050502 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5611105605050.
It is not an unprimeable number, because it can be changed into a prime (5611105605059) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5101004546 + ... + 5101005645.
It is an arithmetic number, because the mean of its divisors is an integer number (474393473928).
Almost surely, 25611105605050 is an apocalyptic number.
5611105605050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5611105605050 is an abundant number, since it is smaller than the sum of its proper divisors (5774337769222).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5611105605050 is a wasteful number, since it uses less digits than its factorization.
5611105605050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10202010214 (or 10202010209 counting only the distinct ones).
The product of its (nonzero) digits is 22500, while the sum is 35.
The spelling of 5611105605050 in words is "five trillion, six hundred eleven billion, one hundred five million, six hundred five thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •