Base | Representation |
---|---|
bin | 1010000000111001000011… |
… | …1100101101100101011111 |
3 | 1102222120212000012201010110 |
4 | 2200032100330231211133 |
5 | 2420343331322422421 |
6 | 35230042331141103 |
7 | 2214322536301146 |
oct | 240162074554537 |
9 | 42876760181113 |
10 | 11010433014111 |
11 | 3565553438923 |
12 | 1299a8b8a4793 |
13 | 61b382a4199b |
14 | 2a0c9d01475d |
15 | 14161759ca76 |
hex | a0390f2d95f |
11010433014111 has 8 divisors (see below), whose sum is σ = 14683203126144. Its totient is φ = 7338975789080.
The previous prime is 11010433014107. The next prime is 11010433014143. The reversal of 11010433014111 is 11141033401011.
11010433014111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 11010433014111 - 22 = 11010433014107 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11010433014311) 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, 328202181 + ... + 328235726.
It is an arithmetic number, because the mean of its divisors is an integer number (1835400390768).
Almost surely, 211010433014111 is an apocalyptic number.
11010433014111 is a deficient number, since it is larger than the sum of its proper divisors (3672770112033).
11010433014111 is an equidigital number, since it uses as much as digits as its factorization.
11010433014111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 656443501.
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 11010433014111 its reverse (11141033401011), we get a palindrome (22151466415122).
The spelling of 11010433014111 in words is "eleven trillion, ten billion, four hundred thirty-three million, fourteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •