Base | Representation |
---|---|
bin | 1010000010110100110011… |
… | …1001100001100011110111 |
3 | 1110002202121000211120221101 |
4 | 2200231030321201203313 |
5 | 2421414344133103403 |
6 | 35253214441230531 |
7 | 2216606653133605 |
oct | 240551471414367 |
9 | 43082530746841 |
10 | 11043651066103 |
11 | 357864a134a57 |
12 | 12a4400492447 |
13 | 621547a26156 |
14 | 2a27309c6875 |
15 | 14240d98d71d |
hex | a0b4ce618f7 |
11043651066103 has 8 divisors (see below), whose sum is σ = 11225513703600. Its totient is φ = 10862950490688.
The previous prime is 11043651066079. The next prime is 11043651066121. The reversal of 11043651066103 is 30166015634011.
11043651066103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11043651066103 - 29 = 11043651065591 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 (11043651066193) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 290496358 + ... + 290534371.
It is an arithmetic number, because the mean of its divisors is an integer number (1403189212950).
Almost surely, 211043651066103 is an apocalyptic number.
11043651066103 is a deficient number, since it is larger than the sum of its proper divisors (181862637497).
11043651066103 is an equidigital number, since it uses as much as digits as its factorization.
11043651066103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 581031041.
The product of its (nonzero) digits is 38880, while the sum is 37.
The spelling of 11043651066103 in words is "eleven trillion, forty-three billion, six hundred fifty-one million, sixty-six thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •