Base | Representation |
---|---|
bin | 1010000110010110001010… |
… | …0001000111110101001001 |
3 | 1110022112201211122222120201 |
4 | 2201211202201013311021 |
5 | 2423412241141411103 |
6 | 35341101212052201 |
7 | 2224151010543265 |
oct | 241454241076511 |
9 | 43275654588521 |
10 | 11104143310153 |
11 | 35a1271461283 |
12 | 12b4083164061 |
13 | 6271684510ba |
14 | 2a562c9b30a5 |
15 | 143c9e52651d |
hex | a1962847d49 |
11104143310153 has 2 divisors, whose sum is σ = 11104143310154. Its totient is φ = 11104143310152.
The previous prime is 11104143310129. The next prime is 11104143310157. The reversal of 11104143310153 is 35101334140111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10824014460169 + 280128849984 = 3289987^2 + 529272^2 .
It is a cyclic number.
It is not a de Polignac number, because 11104143310153 - 29 = 11104143309641 is a prime.
It is not a weakly prime, because it can be changed into another prime (11104143310157) 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 as a sum of consecutive naturals, namely, 5552071655076 + 5552071655077.
It is an arithmetic number, because the mean of its divisors is an integer number (5552071655077).
Almost surely, 211104143310153 is an apocalyptic number.
It is an amenable number.
11104143310153 is a deficient number, since it is larger than the sum of its proper divisors (1).
11104143310153 is an equidigital number, since it uses as much as digits as its factorization.
11104143310153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 28.
Adding to 11104143310153 its reverse (35101334140111), we get a palindrome (46205477450264).
The spelling of 11104143310153 in words is "eleven trillion, one hundred four billion, one hundred forty-three million, three hundred ten thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.020 sec. • engine limits •