Base | Representation |
---|---|
bin | 1010000110001010011101… |
… | …1101101001100000001001 |
3 | 1110022020122010111100211110 |
4 | 2201202213131221200021 |
5 | 2423334324243410410 |
6 | 35335421544320533 |
7 | 2224010153056242 |
oct | 241424735514011 |
9 | 43266563440743 |
10 | 11101005060105 |
11 | 359aa00a545a4 |
12 | 12b3548173149 |
13 | 626a88222bcc |
14 | 2a5411c9dcc9 |
15 | 143b68c74720 |
hex | a18a7769809 |
11101005060105 has 16 divisors (see below), whose sum is σ = 17762828252544. Its totient is φ = 5920129313280.
The previous prime is 11101005060071. The next prime is 11101005060127. The reversal of 11101005060105 is 50106050010111.
It is a happy number.
It is not a de Polignac number, because 11101005060105 - 28 = 11101005059849 is a prime.
It is a super-2 number, since 2×111010050601052 (a number of 27 digits) contains 22 as substring.
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, 25194229 + ... + 25631058.
It is an arithmetic number, because the mean of its divisors is an integer number (1110176765784).
Almost surely, 211101005060105 is an apocalyptic number.
11101005060105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11101005060105 is a deficient number, since it is larger than the sum of its proper divisors (6661823192439).
11101005060105 is a wasteful number, since it uses less digits than its factorization.
11101005060105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50839856.
The product of its (nonzero) digits is 150, while the sum is 21.
Adding to 11101005060105 its reverse (50106050010111), we get a palindrome (61207055070216).
The spelling of 11101005060105 in words is "eleven trillion, one hundred one billion, five million, sixty thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •