Base | Representation |
---|---|
bin | 1010001000000010110110… |
… | …0101110010000010000011 |
3 | 1110102100001012221222221002 |
4 | 2202000231211302002003 |
5 | 2424402014422011321 |
6 | 35402324320122215 |
7 | 2226233023341305 |
oct | 242005545620203 |
9 | 43370035858832 |
10 | 11133320110211 |
11 | 3602683a58a82 |
12 | 12b986646636b |
13 | 629b380cc530 |
14 | 2a6bd9973975 |
15 | 14490ac4420b |
hex | a202d972083 |
11133320110211 has 8 divisors (see below), whose sum is σ = 11989858894944. Its totient is φ = 10276799832000.
The previous prime is 11133320110193. The next prime is 11133320110229. The reversal of 11133320110211 is 11201102333111.
It is an interprime number because it is at equal distance from previous prime (11133320110193) and next prime (11133320110229).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11133320110211 - 226 = 11133253001347 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11133320110811) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3364415 + ... + 5795336.
It is an arithmetic number, because the mean of its divisors is an integer number (1498732361868).
Almost surely, 211133320110211 is an apocalyptic number.
11133320110211 is a deficient number, since it is larger than the sum of its proper divisors (856538784733).
11133320110211 is an equidigital number, since it uses as much as digits as its factorization.
11133320110211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9253261.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 11133320110211 its reverse (11201102333111), we get a palindrome (22334422443322).
The spelling of 11133320110211 in words is "eleven trillion, one hundred thirty-three billion, three hundred twenty million, one hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •