Base | Representation |
---|---|
bin | 10100101011001111… |
… | …01101100101011001 |
3 | 1001122120220001100120 |
4 | 22111213231211121 |
5 | 140213114300410 |
6 | 5033242423453 |
7 | 542033501442 |
oct | 122547554531 |
9 | 31576801316 |
10 | 11100150105 |
11 | 4786822080 |
12 | 2199501b89 |
13 | 107b8c1575 |
14 | 7743002c9 |
15 | 44e773570 |
hex | 2959ed959 |
11100150105 has 64 divisors (see below), whose sum is σ = 19581004800. Its totient is φ = 5324901120.
The previous prime is 11100150077. The next prime is 11100150107. The reversal of 11100150105 is 50105100111.
It is not a de Polignac number, because 11100150105 - 25 = 11100150073 is a prime.
It is a super-2 number, since 2×111001501052 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is not an unprimeable number, because it can be changed into a prime (11100150107) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 8691727 + ... + 8693003.
It is an arithmetic number, because the mean of its divisors is an integer number (305953200).
Almost surely, 211100150105 is an apocalyptic number.
11100150105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11100150105 is a deficient number, since it is larger than the sum of its proper divisors (8480854695).
11100150105 is a wasteful number, since it uses less digits than its factorization.
11100150105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1814.
The product of its (nonzero) digits is 25, while the sum is 15.
Adding to 11100150105 its reverse (50105100111), we get a palindrome (61205250216).
The spelling of 11100150105 in words is "eleven billion, one hundred million, one hundred fifty thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •