Base | Representation |
---|---|
bin | 1010000110001010011111… |
… | …0000101100000001000111 |
3 | 1110022020122110212221020201 |
4 | 2201202213300230001013 |
5 | 2423334332033114033 |
6 | 35335422243311331 |
7 | 2224010243354335 |
oct | 241424760540107 |
9 | 43266573787221 |
10 | 11101010051143 |
11 | 359aa03853421 |
12 | 12b354997b547 |
13 | 626a8927c89c |
14 | 2a54127dcb55 |
15 | 143b6940d47d |
hex | a18a7c2c047 |
11101010051143 has 2 divisors, whose sum is σ = 11101010051144. Its totient is φ = 11101010051142.
The previous prime is 11101010051107. The next prime is 11101010051207. The reversal of 11101010051143 is 34115001010111.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11101010051143 - 221 = 11101007953991 is a prime.
It is a super-3 number, since 3×111010100511433 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 11101010051143.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11101010001143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550505025571 + 5550505025572.
It is an arithmetic number, because the mean of its divisors is an integer number (5550505025572).
Almost surely, 211101010051143 is an apocalyptic number.
11101010051143 is a deficient number, since it is larger than the sum of its proper divisors (1).
11101010051143 is an equidigital number, since it uses as much as digits as its factorization.
11101010051143 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 60, while the sum is 19.
Adding to 11101010051143 its reverse (34115001010111), we get a palindrome (45216011061254).
The spelling of 11101010051143 in words is "eleven trillion, one hundred one billion, ten million, fifty-one thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •