Base | Representation |
---|---|
bin | 1010000110000111010000… |
… | …1010100001111001100101 |
3 | 1110022011102011000211010112 |
4 | 2201201310022201321211 |
5 | 2423331043432111323 |
6 | 35335200321502405 |
7 | 2223646632501005 |
oct | 241416412417145 |
9 | 43264364024115 |
10 | 11100144410213 |
11 | 359a5aa1595a1 |
12 | 12b3347aa1a05 |
13 | 62697bb26311 |
14 | 2a536d868005 |
15 | 143b1841c178 |
hex | a18742a1e65 |
11100144410213 has 24 divisors (see below), whose sum is σ = 12171878273664. Its totient is φ = 10087359784320.
The previous prime is 11100144410177. The next prime is 11100144410263. The reversal of 11100144410213 is 31201444100111.
It is a de Polignac number, because none of the positive numbers 2k-11100144410213 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 (11100144410263) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6470420 + ... + 8004162.
It is an arithmetic number, because the mean of its divisors is an integer number (507161594736).
Almost surely, 211100144410213 is an apocalyptic number.
It is an amenable number.
11100144410213 is a deficient number, since it is larger than the sum of its proper divisors (1071733863451).
11100144410213 is a wasteful number, since it uses less digits than its factorization.
11100144410213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1534265 (or 1534234 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 23.
Adding to 11100144410213 its reverse (31201444100111), we get a palindrome (42301588510324).
The spelling of 11100144410213 in words is "eleven trillion, one hundred billion, one hundred forty-four million, four hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •