Base | Representation |
---|---|
bin | 1010000111010110111001… |
… | …0000110111011001001111 |
3 | 1110101012120212102200221102 |
4 | 2201311232100313121033 |
5 | 2424203333140304203 |
6 | 35353053400053315 |
7 | 2225334432211010 |
oct | 241655620673117 |
9 | 43335525380842 |
10 | 11121520244303 |
11 | 35a8679271087 |
12 | 12b751276423b |
13 | 6289a756b061 |
14 | 2a63da771007 |
15 | 144469d57888 |
hex | a1d6e43764f |
11121520244303 has 12 divisors (see below), whose sum is σ = 12719588011248. Its totient is φ = 9525777340800.
The previous prime is 11121520244297. The next prime is 11121520244309. The reversal of 11121520244303 is 30344202512111.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (11121520244297) and next prime (11121520244309).
It is not a de Polignac number, because 11121520244303 - 26 = 11121520244239 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11121520244309) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 12774503 + ... + 13617303.
It is an arithmetic number, because the mean of its divisors is an integer number (1059965667604).
Almost surely, 211121520244303 is an apocalyptic number.
11121520244303 is a deficient number, since it is larger than the sum of its proper divisors (1598067766945).
11121520244303 is an frugal number, since it uses more digits than its factorization.
11121520244303 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 845554 (or 844181 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 29.
Adding to 11121520244303 its reverse (30344202512111), we get a palindrome (41465722756414).
The spelling of 11121520244303 in words is "eleven trillion, one hundred twenty-one billion, five hundred twenty million, two hundred forty-four thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •