Base | Representation |
---|---|
bin | 1010000010110110101000… |
… | …0111000001100000100111 |
3 | 1110002210212012000010120102 |
4 | 2200231222013001200213 |
5 | 2421421400113102403 |
6 | 35253335225254315 |
7 | 2216625053544464 |
oct | 240555207014047 |
9 | 43083765003512 |
10 | 11044141144103 |
11 | 35788808348a1 |
12 | 12a451863439b |
13 | 6215c5416032 |
14 | 2a2779b1866b |
15 | 14243b9e6b88 |
hex | a0b6a1c1827 |
11044141144103 has 4 divisors (see below), whose sum is σ = 11048297767440. Its totient is φ = 11039984520768.
The previous prime is 11044141144061. The next prime is 11044141144121. The reversal of 11044141144103 is 30144114144011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11044141144103 - 216 = 11044141078567 is a prime.
It is a super-2 number, since 2×110441411441032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11044141144193) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2078307683 + ... + 2078312996.
It is an arithmetic number, because the mean of its divisors is an integer number (2762074441860).
Almost surely, 211044141144103 is an apocalyptic number.
11044141144103 is a deficient number, since it is larger than the sum of its proper divisors (4156623337).
11044141144103 is an equidigital number, since it uses as much as digits as its factorization.
11044141144103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4156623336.
The product of its (nonzero) digits is 3072, while the sum is 29.
Adding to 11044141144103 its reverse (30144114144011), we get a palindrome (41188255288114).
The spelling of 11044141144103 in words is "eleven trillion, forty-four billion, one hundred forty-one million, one hundred forty-four thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •