Base | Representation |
---|---|
bin | 1010000000111011100101… |
… | …1011110110101110000111 |
3 | 1102222122121100100022102012 |
4 | 2200032321123312232013 |
5 | 2420401224220013011 |
6 | 35230233554004435 |
7 | 2214345424661201 |
oct | 240167133665607 |
9 | 42878540308365 |
10 | 11011112266631 |
11 | 35658718a7344 |
12 | 129a03b27671b |
13 | 61b460698659 |
14 | 2a0d2530b771 |
15 | 141657022a8b |
hex | a03b96f6b87 |
11011112266631 has 4 divisors (see below), whose sum is σ = 11120133180264. Its totient is φ = 10902091353000.
The previous prime is 11011112266571. The next prime is 11011112266633. The reversal of 11011112266631 is 13666221111011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11011112266631 is a prime.
It is a super-2 number, since 2×110111122666312 (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 (11011112266633) 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, 54510456665 + ... + 54510456866.
It is an arithmetic number, because the mean of its divisors is an integer number (2780033295066).
Almost surely, 211011112266631 is an apocalyptic number.
11011112266631 is a deficient number, since it is larger than the sum of its proper divisors (109020913633).
11011112266631 is a wasteful number, since it uses less digits than its factorization.
11011112266631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 109020913632.
The product of its (nonzero) digits is 2592, while the sum is 32.
Adding to 11011112266631 its reverse (13666221111011), we get a palindrome (24677333377642).
The spelling of 11011112266631 in words is "eleven trillion, eleven billion, one hundred twelve million, two hundred sixty-six thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •