Base | Representation |
---|---|
bin | 1010000110101111110001… |
… | …1010011010101101000011 |
3 | 1110100012111002202202002111 |
4 | 2201223330122122231003 |
5 | 2424020332133223021 |
6 | 35344155432000151 |
7 | 2224513303333030 |
oct | 241537432325503 |
9 | 43305432682074 |
10 | 11111020211011 |
11 | 35a4180277716 |
12 | 12b5482230057 |
13 | 6279c30b65c6 |
14 | 2a5ac2048387 |
15 | 1440531268e1 |
hex | a1afc69ab43 |
11111020211011 has 8 divisors (see below), whose sum is σ = 12769249086720. Its totient is φ = 9470526403848.
The previous prime is 11111020210951. The next prime is 11111020211041. The reversal of 11111020211011 is 11011202011111.
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 11111020211011 - 221 = 11111018113859 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11111020210982 and 11111020211000.
It is not an unprimeable number, because it can be changed into a prime (11111020211041) 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, 4433765791 + ... + 4433768296.
It is an arithmetic number, because the mean of its divisors is an integer number (1596156135840).
Almost surely, 211111020211011 is an apocalyptic number.
11111020211011 is a deficient number, since it is larger than the sum of its proper divisors (1658228875709).
11111020211011 is an equidigital number, since it uses as much as digits as its factorization.
11111020211011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8867534273.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 11111020211011 its reverse (11011202011111), we get a palindrome (22122222222122).
The spelling of 11111020211011 in words is "eleven trillion, one hundred eleven billion, twenty million, two hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •