Base | Representation |
---|---|
bin | 1010001100100100010100… |
… | …1111110001110011110100 |
3 | 1110200202121201001212011002 |
4 | 2203021011033301303310 |
5 | 2432140140230003034 |
6 | 35502135135502432 |
7 | 2234653454064431 |
oct | 243110517616364 |
9 | 43622551055132 |
10 | 11211026406644 |
11 | 363262a154679 |
12 | 1310932087a18 |
13 | 63426cc850ac |
14 | 2aa88bc3cb88 |
15 | 146957b86e7e |
hex | a32453f1cf4 |
11211026406644 has 24 divisors (see below), whose sum is σ = 19627692850080. Its totient is φ = 5603114581664.
The previous prime is 11211026406631. The next prime is 11211026406661. The reversal of 11211026406644 is 44660462011211.
11211026406644 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×112110264066442 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11211026406598 and 11211026406607.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 122167802 + ... + 122259534.
It is an arithmetic number, because the mean of its divisors is an integer number (817820535420).
Almost surely, 211211026406644 is an apocalyptic number.
It is an amenable number.
11211026406644 is a deficient number, since it is larger than the sum of its proper divisors (8416666443436).
11211026406644 is a wasteful number, since it uses less digits than its factorization.
11211026406644 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 104479 (or 104477 counting only the distinct ones).
The product of its (nonzero) digits is 55296, while the sum is 38.
Adding to 11211026406644 its reverse (44660462011211), we get a palindrome (55871488417855).
The spelling of 11211026406644 in words is "eleven trillion, two hundred eleven billion, twenty-six million, four hundred six thousand, six hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •