Base | Representation |
---|---|
bin | 1010000000010110011001… |
… | …1101110111010111010011 |
3 | 1102221200211200121102001112 |
4 | 2200011212131313113103 |
5 | 2420220303332200120 |
6 | 35221503254523535 |
7 | 2213543160043430 |
oct | 240054635672723 |
9 | 42850750542045 |
10 | 11001130350035 |
11 | 356160a3136a1 |
12 | 12981143665ab |
13 | 61a52c670127 |
14 | 2a0659734b87 |
15 | 141270a37bc5 |
hex | a01667775d3 |
11001130350035 has 32 divisors (see below), whose sum is σ = 15608269071360. Its totient is φ = 7283155082112.
The previous prime is 11001130350017. The next prime is 11001130350047. The reversal of 11001130350035 is 53005303110011.
It is a de Polignac number, because none of the positive numbers 2k-11001130350035 is a prime.
It is a super-2 number, since 2×110011303500352 (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 (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 21659762 + ... + 22161848.
It is an arithmetic number, because the mean of its divisors is an integer number (487758408480).
Almost surely, 211001130350035 is an apocalyptic number.
11001130350035 is a deficient number, since it is larger than the sum of its proper divisors (4607138721325).
11001130350035 is a wasteful number, since it uses less digits than its factorization.
11001130350035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 523715.
The product of its (nonzero) digits is 675, while the sum is 23.
Adding to 11001130350035 its reverse (53005303110011), we get a palindrome (64006433460046).
The spelling of 11001130350035 in words is "eleven trillion, one billion, one hundred thirty million, three hundred fifty thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •