Base | Representation |
---|---|
bin | 1010000110010011001000… |
… | …1110000100111010111110 |
3 | 1110022110122100221112021221 |
4 | 2201210302032010322332 |
5 | 2423404111222324014 |
6 | 35340444544343554 |
7 | 2224121641243420 |
oct | 241446216047276 |
9 | 43273570845257 |
10 | 11103333011134 |
11 | 35a0996026671 |
12 | 12b3a97914bba |
13 | 627069603520 |
14 | 2a5593126810 |
15 | 143c53317b24 |
hex | a1932384ebe |
11103333011134 has 32 divisors (see below), whose sum is σ = 21052473414336. Its totient is φ = 4273810387200.
The previous prime is 11103333011131. The next prime is 11103333011179. The reversal of 11103333011134 is 43111033330111.
It is a super-2 number, since 2×111033330111342 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11103333011099 and 11103333011108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11103333011131) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 824416567 + ... + 824430034.
It is an arithmetic number, because the mean of its divisors is an integer number (657889794198).
Almost surely, 211103333011134 is an apocalyptic number.
11103333011134 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
11103333011134 is a deficient number, since it is larger than the sum of its proper divisors (9949140403202).
11103333011134 is a wasteful number, since it uses less digits than its factorization.
11103333011134 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1648846660.
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 11103333011134 its reverse (43111033330111), we get a palindrome (54214366341245).
The spelling of 11103333011134 in words is "eleven trillion, one hundred three billion, three hundred thirty-three million, eleven thousand, one hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •