Base | Representation |
---|---|
bin | 1010000110011011000001… |
… | …1110101110010011000101 |
3 | 1110022200002222212222000012 |
4 | 2201212300132232103011 |
5 | 2423422431013213013 |
6 | 35341435055000005 |
7 | 2224225302366644 |
oct | 241466036562305 |
9 | 43280088788005 |
10 | 11105451304133 |
11 | 35a188281953a |
12 | 12b4389209005 |
13 | 627316427834 |
14 | 2a57145b535b |
15 | 143d292951a8 |
hex | a19b07ae4c5 |
11105451304133 has 2 divisors, whose sum is σ = 11105451304134. Its totient is φ = 11105451304132.
The previous prime is 11105451303971. The next prime is 11105451304141. The reversal of 11105451304133 is 33140315450111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10935342900769 + 170108403364 = 3306863^2 + 412442^2 .
It is a cyclic number.
It is not a de Polignac number, because 11105451304133 - 222 = 11105447109829 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11105451304133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11105451304193) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5552725652066 + 5552725652067.
It is an arithmetic number, because the mean of its divisors is an integer number (5552725652067).
Almost surely, 211105451304133 is an apocalyptic number.
It is an amenable number.
11105451304133 is a deficient number, since it is larger than the sum of its proper divisors (1).
11105451304133 is an equidigital number, since it uses as much as digits as its factorization.
11105451304133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10800, while the sum is 32.
Adding to 11105451304133 its reverse (33140315450111), we get a palindrome (44245766754244).
The spelling of 11105451304133 in words is "eleven trillion, one hundred five billion, four hundred fifty-one million, three hundred four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •