Base | Representation |
---|---|
bin | 1010000111010001010110… |
… | …1000001111110010011111 |
3 | 1110101001202020022002110001 |
4 | 2201310111220033302133 |
5 | 2424142311444420221 |
6 | 35352250035355131 |
7 | 2225252534436466 |
oct | 241642550176237 |
9 | 43331666262401 |
10 | 11120033201311 |
11 | 35a7a85930731 |
12 | 12b7178752aa7 |
13 | 6287cb464568 |
14 | 2a62d90819dd |
15 | 1443ce51c391 |
hex | a1d15a0fc9f |
11120033201311 has 8 divisors (see below), whose sum is σ = 11302553402784. Its totient is φ = 10937520244320.
The previous prime is 11120033201267. The next prime is 11120033201353. The reversal of 11120033201311 is 11310233002111.
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 11120033201311 - 221 = 11120031104159 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11120033211311) 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, 1328301 + ... + 4899433.
It is an arithmetic number, because the mean of its divisors is an integer number (1412819175348).
Almost surely, 211120033201311 is an apocalyptic number.
11120033201311 is a deficient number, since it is larger than the sum of its proper divisors (182520201473).
11120033201311 is an equidigital number, since it uses as much as digits as its factorization.
11120033201311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3622241.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 11120033201311 its reverse (11310233002111), we get a palindrome (22430266203422).
The spelling of 11120033201311 in words is "eleven trillion, one hundred twenty billion, thirty-three million, two hundred one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •