Base | Representation |
---|---|
bin | 1010000110011001100010… |
… | …0100010001100100000011 |
3 | 1110022122002000221222210100 |
4 | 2201212120210101210003 |
5 | 2423421120311343430 |
6 | 35341331203533443 |
7 | 2224212331305300 |
oct | 241463044214403 |
9 | 43278060858710 |
10 | 11105050106115 |
11 | 35a1697305529 |
12 | 12b429698a283 |
13 | 627281286b64 |
14 | 2a56b71bc0a7 |
15 | 143d03e46960 |
hex | a1998911903 |
11105050106115 has 36 divisors (see below), whose sum is σ = 22391407157184. Its totient is φ = 5076594333216.
The previous prime is 11105050106099. The next prime is 11105050106119. The reversal of 11105050106115 is 51160105050111.
It is not a de Polignac number, because 11105050106115 - 24 = 11105050106099 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11105050106119) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 2518149747 + ... + 2518154156.
It is an arithmetic number, because the mean of its divisors is an integer number (621983532144).
Almost surely, 211105050106115 is an apocalyptic number.
11105050106115 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
11105050106115 is an abundant number, since it is smaller than the sum of its proper divisors (11286357051069).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11105050106115 is a wasteful number, since it uses less digits than its factorization.
11105050106115 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5036303928 (or 5036303918 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 27.
Adding to 11105050106115 its reverse (51160105050111), we get a palindrome (62265155156226).
The spelling of 11105050106115 in words is "eleven trillion, one hundred five billion, fifty million, one hundred six thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •