Base | Representation |
---|---|
bin | 1010000000101010111010… |
… | …0010011001101100000111 |
3 | 1102222020001021120110210102 |
4 | 2200022232202121230013 |
5 | 2420313041410403210 |
6 | 35224213355114315 |
7 | 2214126443210054 |
oct | 240125642315407 |
9 | 42866037513712 |
10 | 11006634466055 |
11 | 3563984239508 |
12 | 12991ab74299b |
13 | 61abc8a95407 |
14 | 2a0a1c74002b |
15 | 141493d6bea5 |
hex | a02ae899b07 |
11006634466055 has 8 divisors (see below), whose sum is σ = 13903117220400. Its totient is φ = 8341870332096.
The previous prime is 11006634466049. The next prime is 11006634466057. The reversal of 11006634466055 is 55066443660011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11006634466055 - 24 = 11006634466039 is a prime.
It is a super-2 number, since 2×110066344660552 (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 (11006634466057) 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 7 ways as a sum of consecutive naturals, for example, 57929654990 + ... + 57929655179.
It is an arithmetic number, because the mean of its divisors is an integer number (1737889652550).
Almost surely, 211006634466055 is an apocalyptic number.
11006634466055 is a deficient number, since it is larger than the sum of its proper divisors (2896482754345).
11006634466055 is a wasteful number, since it uses less digits than its factorization.
11006634466055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115859310193.
The product of its (nonzero) digits is 1555200, while the sum is 47.
The spelling of 11006634466055 in words is "eleven trillion, six billion, six hundred thirty-four million, four hundred sixty-six thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •