Base | Representation |
---|---|
bin | 1010000001110010001010… |
… | …0011001111101001100001 |
3 | 1110001001102012222111121111 |
4 | 2200130202203033221201 |
5 | 2421121224220311223 |
6 | 35241055313023321 |
7 | 2215404425503633 |
oct | 240344243175141 |
9 | 43031365874544 |
10 | 11025760713313 |
11 | 3570aa9533125 |
12 | 12a0a48b54b41 |
13 | 61c956436498 |
14 | 2a191497ca53 |
15 | 141c1304330d |
hex | a07228cfa61 |
11025760713313 has 4 divisors (see below), whose sum is σ = 11031168150720. Its totient is φ = 11020353275908.
The previous prime is 11025760713311. The next prime is 11025760713329. The reversal of 11025760713313 is 31331706752011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 11025760713313 - 21 = 11025760713311 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11025760713311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2703715645 + ... + 2703719722.
It is an arithmetic number, because the mean of its divisors is an integer number (2757792037680).
Almost surely, 211025760713313 is an apocalyptic number.
It is an amenable number.
11025760713313 is a deficient number, since it is larger than the sum of its proper divisors (5407437407).
11025760713313 is an equidigital number, since it uses as much as digits as its factorization.
11025760713313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5407437406.
The product of its (nonzero) digits is 79380, while the sum is 40.
The spelling of 11025760713313 in words is "eleven trillion, twenty-five billion, seven hundred sixty million, seven hundred thirteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •