Base | Representation |
---|---|
bin | 1010000001001000101000… |
… | …1010110001011010110100 |
3 | 1102222222122101220022101201 |
4 | 2200102022022301122310 |
5 | 2420430412220222422 |
6 | 35232013253102244 |
7 | 2214531260103103 |
oct | 240221212613264 |
9 | 42888571808351 |
10 | 11014614226612 |
11 | 35672a9642747 |
12 | 129a858027984 |
13 | 61b89b070119 |
14 | 2a117845a03a |
15 | 1417ae6ba727 |
hex | a048a2b16b4 |
11014614226612 has 6 divisors (see below), whose sum is σ = 19275574896578. Its totient is φ = 5507307113304.
The previous prime is 11014614226607. The next prime is 11014614226619. The reversal of 11014614226612 is 21662241641011.
It can be written as a sum of positive squares in only one way, i.e., 10540645316496 + 473968910116 = 3246636^2 + 688454^2 .
It is a super-2 number, since 2×110146142266122 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11014614226619) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1376826778323 + ... + 1376826778330.
Almost surely, 211014614226612 is an apocalyptic number.
It is an amenable number.
11014614226612 is a deficient number, since it is larger than the sum of its proper divisors (8260960669966).
11014614226612 is a wasteful number, since it uses less digits than its factorization.
11014614226612 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2753653556657 (or 2753653556655 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 37.
Adding to 11014614226612 its reverse (21662241641011), we get a palindrome (32676855867623).
The spelling of 11014614226612 in words is "eleven trillion, fourteen billion, six hundred fourteen million, two hundred twenty-six thousand, six hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •