Base | Representation |
---|---|
bin | 1010000000110111100100… |
… | …1000000010101110100111 |
3 | 1102222112211011010201010101 |
4 | 2200031321020002232213 |
5 | 2420342022013043421 |
6 | 35225534532404531 |
7 | 2214306614116453 |
oct | 240157110025647 |
9 | 42875734121111 |
10 | 11010033331111 |
11 | 356536886a0a1 |
12 | 1299999a76747 |
13 | 61b31acb1779 |
14 | 2a0c61cd3663 |
15 | 1415e244d191 |
hex | a0379202ba7 |
11010033331111 has 4 divisors (see below), whose sum is σ = 11015596765800. Its totient is φ = 11004469896424.
The previous prime is 11010033331103. The next prime is 11010033331147. The reversal of 11010033331111 is 11113333001011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11010033331111 - 23 = 11010033331103 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 (11010033311111) 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, 2781714376 + ... + 2781718333.
It is an arithmetic number, because the mean of its divisors is an integer number (2753899191450).
Almost surely, 211010033331111 is an apocalyptic number.
11010033331111 is a deficient number, since it is larger than the sum of its proper divisors (5563434689).
11010033331111 is an equidigital number, since it uses as much as digits as its factorization.
11010033331111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5563434688.
The product of its (nonzero) digits is 81, while the sum is 19.
Adding to 11010033331111 its reverse (11113333001011), we get a palindrome (22123366332122).
The spelling of 11010033331111 in words is "eleven trillion, ten billion, thirty-three million, three hundred thirty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •