Base | Representation |
---|---|
bin | 1010000111100101101110… |
… | …0000010110011111001011 |
3 | 1110101120212020222211210122 |
4 | 2201321123200112133023 |
5 | 2424240011112112021 |
6 | 35354552342533455 |
7 | 2225535162646505 |
oct | 241713340263713 |
9 | 43346766884718 |
10 | 11125500504011 |
11 | 35aa330aa2113 |
12 | 12b824373728b |
13 | 62919006a60a |
14 | 2a6697226d75 |
15 | 1445ee4cdbab |
hex | a1e5b8167cb |
11125500504011 has 8 divisors (see below), whose sum is σ = 11136225172800. Its totient is φ = 11114778268800.
The previous prime is 11125500503981. The next prime is 11125500504031. The reversal of 11125500504011 is 11040500552111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11125500504011 - 214 = 11125500487627 is a prime.
It is a super-2 number, since 2×111255005040112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11125500504031) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 8606510 + ... + 9814428.
It is an arithmetic number, because the mean of its divisors is an integer number (1392028146600).
Almost surely, 211125500504011 is an apocalyptic number.
11125500504011 is a deficient number, since it is larger than the sum of its proper divisors (10724668789).
11125500504011 is a wasteful number, since it uses less digits than its factorization.
11125500504011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1216789.
The product of its (nonzero) digits is 1000, while the sum is 26.
The spelling of 11125500504011 in words is "eleven trillion, one hundred twenty-five billion, five hundred million, five hundred four thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •