Base | Representation |
---|---|
bin | 1010001000100111000000… |
… | …0110111001011010100011 |
3 | 1110110021002122100101221101 |
4 | 2202021300012321122203 |
5 | 2430031404130201201 |
6 | 35411011355335231 |
7 | 2230025400255340 |
oct | 242116006713243 |
9 | 43407078311841 |
10 | 11143026022051 |
11 | 3606804767220 |
12 | 12bb714a51517 |
13 | 62aa23baba31 |
14 | 2a747aa217c7 |
15 | 144cc7daed01 |
hex | a22701b96a3 |
11143026022051 has 16 divisors (see below), whose sum is σ = 13894194071808. Its totient is φ = 8681883544800.
The previous prime is 11143026022043. The next prime is 11143026022127. The reversal of 11143026022051 is 15022062034111.
It is a cyclic number.
It is not a de Polignac number, because 11143026022051 - 23 = 11143026022043 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11143026022651) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7604865 + ... + 8950978.
It is an arithmetic number, because the mean of its divisors is an integer number (868387129488).
Almost surely, 211143026022051 is an apocalyptic number.
11143026022051 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11143026022051 is a deficient number, since it is larger than the sum of its proper divisors (2751168049757).
11143026022051 is a wasteful number, since it uses less digits than its factorization.
11143026022051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16564602.
The product of its (nonzero) digits is 2880, while the sum is 28.
Adding to 11143026022051 its reverse (15022062034111), we get a palindrome (26165088056162).
The spelling of 11143026022051 in words is "eleven trillion, one hundred forty-three billion, twenty-six million, twenty-two thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •