Base | Representation |
---|---|
bin | 1010000111100101101110… |
… | …0000010110011111001101 |
3 | 1110101120212020222211210201 |
4 | 2201321123200112133031 |
5 | 2424240011112112023 |
6 | 35354552342533501 |
7 | 2225535162646510 |
oct | 241713340263715 |
9 | 43346766884721 |
10 | 11125500504013 |
11 | 35aa330aa2115 |
12 | 12b8243737291 |
13 | 62919006a60c |
14 | 2a6697226d77 |
15 | 1445ee4cdbad |
hex | a1e5b8167cd |
11125500504013 has 8 divisors (see below), whose sum is σ = 12715021744128. Its totient is φ = 9536020270224.
The previous prime is 11125500503981. The next prime is 11125500504031. The reversal of 11125500504013 is 31040500552111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11125500504013 - 25 = 11125500503981 is a prime.
It is a super-2 number, since 2×111255005040132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11125500505013) 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, 9667981 + ... + 10757362.
It is an arithmetic number, because the mean of its divisors is an integer number (1589377718016).
Almost surely, 211125500504013 is an apocalyptic number.
It is an amenable number.
11125500504013 is a deficient number, since it is larger than the sum of its proper divisors (1589521240115).
11125500504013 is an equidigital number, since it uses as much as digits as its factorization.
11125500504013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20503163.
The product of its (nonzero) digits is 3000, while the sum is 28.
The spelling of 11125500504013 in words is "eleven trillion, one hundred twenty-five billion, five hundred million, five hundred four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •