Base | Representation |
---|---|
bin | 1010000110010110000000… |
… | …1000100000001111111111 |
3 | 1110022112122001101100220120 |
4 | 2201211200020200033333 |
5 | 2423412200421132033 |
6 | 35341053222350023 |
7 | 2224150013512665 |
oct | 241454010401777 |
9 | 43275561340816 |
10 | 11104103302143 |
11 | 35a1250915705 |
12 | 12b407188b313 |
13 | 627160083a17 |
14 | 2a562755ac35 |
15 | 143c9ac721b3 |
hex | a19602203ff |
11104103302143 has 16 divisors (see below), whose sum is σ = 15567086604000. Its totient is φ = 7030297169280.
The previous prime is 11104103302031. The next prime is 11104103302199. The reversal of 11104103302143 is 34120330140111.
It is a happy number.
It is not a de Polignac number, because 11104103302143 - 210 = 11104103301119 is a prime.
It is a super-2 number, since 2×111041033021432 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11104103312143) 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, 1046169868 + ... + 1046180481.
It is an arithmetic number, because the mean of its divisors is an integer number (972942912750).
Almost surely, 211104103302143 is an apocalyptic number.
11104103302143 is a deficient number, since it is larger than the sum of its proper divisors (4462983301857).
11104103302143 is a wasteful number, since it uses less digits than its factorization.
11104103302143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2092350442.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 11104103302143 its reverse (34120330140111), we get a palindrome (45224433442254).
The spelling of 11104103302143 in words is "eleven trillion, one hundred four billion, one hundred three million, three hundred two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •