Base | Representation |
---|---|
bin | 1010000110110000000100… |
… | …1100000000110011110101 |
3 | 1110100012200200111202100121 |
4 | 2201230001030000303311 |
5 | 2424021013140233023 |
6 | 35344211413011541 |
7 | 2224515265264630 |
oct | 241540114006365 |
9 | 43305620452317 |
10 | 11111100321013 |
11 | 35a4211513530 |
12 | 12b54a5023bb1 |
13 | 627a06884a84 |
14 | 2a5acc93cc17 |
15 | 14405a19cd5d |
hex | a1b01300cf5 |
11111100321013 has 8 divisors (see below), whose sum is σ = 13852800400320. Its totient is φ = 8658000250080.
The previous prime is 11111100320989. The next prime is 11111100321059. The reversal of 11111100321013 is 31012300111111.
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 11111100321013 - 229 = 11110563450101 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11111100321913) 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, 72150002008 + ... + 72150002161.
It is an arithmetic number, because the mean of its divisors is an integer number (1731600050040).
Almost surely, 211111100321013 is an apocalyptic number.
It is an amenable number.
11111100321013 is a deficient number, since it is larger than the sum of its proper divisors (2741700079307).
11111100321013 is a wasteful number, since it uses less digits than its factorization.
11111100321013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144300004187.
The product of its (nonzero) digits is 18, while the sum is 16.
Adding to 11111100321013 its reverse (31012300111111), we get a palindrome (42123400432124).
The spelling of 11111100321013 in words is "eleven trillion, one hundred eleven billion, one hundred million, three hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •