Base | Representation |
---|---|
bin | 1010000110001010011111… |
… | …0000011111110011110111 |
3 | 1110022020122110210101122212 |
4 | 2201202213300133303313 |
5 | 2423334332030014033 |
6 | 35335422242244035 |
7 | 2224010243055506 |
oct | 241424760376367 |
9 | 43266573711585 |
10 | 11101010001143 |
11 | 359aa038198a7 |
12 | 12b354995661b |
13 | 626a89262bba |
14 | 2a54127c883d |
15 | 143b693ed748 |
hex | a18a7c1fcf7 |
11101010001143 has 2 divisors, whose sum is σ = 11101010001144. Its totient is φ = 11101010001142.
The previous prime is 11101010001091. The next prime is 11101010001157. The reversal of 11101010001143 is 34110001010111.
It is a happy number.
It is an a-pointer prime, because the next prime (11101010001157) can be obtained adding 11101010001143 to its sum of digits (14).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11101010001143 - 218 = 11101009738999 is a prime.
It is a super-2 number, since 2×111010100011432 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11101010051143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550505000571 + 5550505000572.
It is an arithmetic number, because the mean of its divisors is an integer number (5550505000572).
Almost surely, 211101010001143 is an apocalyptic number.
11101010001143 is a deficient number, since it is larger than the sum of its proper divisors (1).
11101010001143 is an equidigital number, since it uses as much as digits as its factorization.
11101010001143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 11101010001143 its reverse (34110001010111), we get a palindrome (45211011011254).
The spelling of 11101010001143 in words is "eleven trillion, one hundred one billion, ten million, one thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •