Base | Representation |
---|---|
bin | 1010000001011101100001… |
… | …0011001001000111111001 |
3 | 1110000112010002011122220202 |
4 | 2200113120103021013321 |
5 | 2421023402310323001 |
6 | 35234341424331545 |
7 | 2215120216350605 |
oct | 240273023110771 |
9 | 43015102148822 |
10 | 11020220011001 |
11 | 3569715999503 |
12 | 129b961473bb5 |
13 | 61c2825713c6 |
14 | 2a154ab6c505 |
15 | 1419db8d396b |
hex | a05d84c91f9 |
11020220011001 has 4 divisors (see below), whose sum is σ = 11066329718400. Its totient is φ = 10974110303604.
The previous prime is 11020220010979. The next prime is 11020220011019. The reversal of 11020220011001 is 10011002202011.
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 11020220011001 - 214 = 11020219994617 is a prime.
It is a super-2 number, since 2×110202200110012 (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 (11020220011601) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23054853341 + ... + 23054853818.
It is an arithmetic number, because the mean of its divisors is an integer number (2766582429600).
Almost surely, 211020220011001 is an apocalyptic number.
It is an amenable number.
11020220011001 is a deficient number, since it is larger than the sum of its proper divisors (46109707399).
11020220011001 is an equidigital number, since it uses as much as digits as its factorization.
11020220011001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 46109707398.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 11020220011001 its reverse (10011002202011), we get a palindrome (21031222213012).
The spelling of 11020220011001 in words is "eleven trillion, twenty billion, two hundred twenty million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •