Base | Representation |
---|---|
bin | 1010000010101000000000… |
… | …0011010100010101101111 |
3 | 1110002102201111221222210012 |
4 | 2200222000003110111233 |
5 | 2421340324330212421 |
6 | 35251445431403435 |
7 | 2216425542135416 |
oct | 240520003242557 |
9 | 43072644858705 |
10 | 11040214304111 |
11 | 357714617a893 |
12 | 12a380152357b |
13 | 62111a9cb585 |
14 | 2a24c63aa47d |
15 | 1422abdc395b |
hex | a0a800d456f |
11040214304111 has 8 divisors (see below), whose sum is σ = 11047825338000. Its totient is φ = 11032604287488.
The previous prime is 11040214304081. The next prime is 11040214304113. The reversal of 11040214304111 is 11140341204011.
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 11040214304111 - 26 = 11040214304047 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 (11040214304113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22136015 + ... + 22629263.
It is an arithmetic number, because the mean of its divisors is an integer number (1380978167250).
Almost surely, 211040214304111 is an apocalyptic number.
11040214304111 is a deficient number, since it is larger than the sum of its proper divisors (7611033889).
11040214304111 is a wasteful number, since it uses less digits than its factorization.
11040214304111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 508633.
The product of its (nonzero) digits is 384, while the sum is 23.
Adding to 11040214304111 its reverse (11140341204011), we get a palindrome (22180555508122).
The spelling of 11040214304111 in words is "eleven trillion, forty billion, two hundred fourteen million, three hundred four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •