Base | Representation |
---|---|
bin | 1010000000100101001100… |
… | …0101000100011010001100 |
3 | 1102222002002100022001202101 |
4 | 2200021103011010122030 |
5 | 2420301421103100220 |
6 | 35223401223204444 |
7 | 2214043431662044 |
oct | 240112305043214 |
9 | 42862070261671 |
10 | 11005100050060 |
11 | 3563267092016 |
12 | 1298a418a6724 |
13 | 61aa12c1315c |
14 | 2a0914a3c724 |
15 | 1414042c530a |
hex | a025314468c |
11005100050060 has 12 divisors (see below), whose sum is σ = 23110710105168. Its totient is φ = 4402040020016.
The previous prime is 11005100050003. The next prime is 11005100050073. The reversal of 11005100050060 is 6005000150011.
It is a super-2 number, since 2×110051000500602 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 275127501232 + ... + 275127501271.
It is an arithmetic number, because the mean of its divisors is an integer number (1925892508764).
Almost surely, 211005100050060 is an apocalyptic number.
11005100050060 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11005100050060 is an abundant number, since it is smaller than the sum of its proper divisors (12105610055108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11005100050060 is a wasteful number, since it uses less digits than its factorization.
11005100050060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 550255002512 (or 550255002510 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 19.
The spelling of 11005100050060 in words is "eleven trillion, five billion, one hundred million, fifty thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •