Base | Representation |
---|---|
bin | 1010000000101010001111… |
… | …0110100110011010001111 |
3 | 1102222012120210021101222212 |
4 | 2200022203312212122033 |
5 | 2420312210013233123 |
6 | 35224143513101035 |
7 | 2214122135445362 |
oct | 240124366463217 |
9 | 42865523241885 |
10 | 11006455211663 |
11 | 35638a2035a8a |
12 | 129915b6b777b |
13 | 61ab9a8c2a22 |
14 | 2a0a029dc0d9 |
15 | 14148325e878 |
hex | a02a3da668f |
11006455211663 has 4 divisors (see below), whose sum is σ = 11008692755760. Its totient is φ = 11004217667568.
The previous prime is 11006455211659. The next prime is 11006455211677. The reversal of 11006455211663 is 36611255460011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11006455211663 - 22 = 11006455211659 is a prime.
It is a super-2 number, since 2×110064552116632 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11006455211663.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11006455211623) 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, 1118764670 + ... + 1118774507.
It is an arithmetic number, because the mean of its divisors is an integer number (2752173188940).
Almost surely, 211006455211663 is an apocalyptic number.
11006455211663 is a deficient number, since it is larger than the sum of its proper divisors (2237544097).
11006455211663 is an equidigital number, since it uses as much as digits as its factorization.
11006455211663 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2237544096.
The product of its (nonzero) digits is 129600, while the sum is 41.
The spelling of 11006455211663 in words is "eleven trillion, six billion, four hundred fifty-five million, two hundred eleven thousand, six hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •