Base | Representation |
---|---|
bin | 1010000000010110011001… |
… | …1101110111010110111111 |
3 | 1102221200211200121102000210 |
4 | 2200011212131313112333 |
5 | 2420220303332200030 |
6 | 35221503254523503 |
7 | 2213543160043401 |
oct | 240054635672677 |
9 | 42850750542023 |
10 | 11001130350015 |
11 | 356160a313683 |
12 | 1298114366593 |
13 | 61a52c670110 |
14 | 2a0659734b71 |
15 | 141270a37bb0 |
hex | a01667775bf |
11001130350015 has 16 divisors (see below), whose sum is σ = 18955793834208. Its totient is φ = 5415941095296.
The previous prime is 11001130349929. The next prime is 11001130350017. The reversal of 11001130350015 is 51005303110011.
It is not a de Polignac number, because 11001130350015 - 226 = 11001063241151 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11001130349973 and 11001130350000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11001130350017) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 28208026344 + ... + 28208026733.
It is an arithmetic number, because the mean of its divisors is an integer number (1184737114638).
Almost surely, 211001130350015 is an apocalyptic number.
11001130350015 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
11001130350015 is a deficient number, since it is larger than the sum of its proper divisors (7954663484193).
11001130350015 is a wasteful number, since it uses less digits than its factorization.
11001130350015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56416053098.
The product of its (nonzero) digits is 225, while the sum is 21.
Adding to 11001130350015 its reverse (51005303110011), we get a palindrome (62006433460026).
The spelling of 11001130350015 in words is "eleven trillion, one billion, one hundred thirty million, three hundred fifty thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •