Base | Representation |
---|---|
bin | 1010001101000101110010… |
… | …1101111001000000011101 |
3 | 1110201121210210111022202020 |
4 | 2203101130231321000131 |
5 | 2432312040042023010 |
6 | 35510222415450353 |
7 | 2235422211235353 |
oct | 243213455710035 |
9 | 43647723438666 |
10 | 11220010111005 |
11 | 363641a225733 |
12 | 131261a8269b9 |
13 | 63507224b0a7 |
14 | 2ab0a10117d3 |
15 | 146cd16e5470 |
hex | a345cb7901d |
11220010111005 has 32 divisors (see below), whose sum is σ = 19075661440128. Its totient is φ = 5611962316800.
The previous prime is 11220010110979. The next prime is 11220010111019. The reversal of 11220010111005 is 50011101002211.
It is not a de Polignac number, because 11220010111005 - 26 = 11220010110941 is a prime.
It is a super-2 number, since 2×112200101110052 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 78220231 + ... + 78363540.
It is an arithmetic number, because the mean of its divisors is an integer number (596114420004).
Almost surely, 211220010111005 is an apocalyptic number.
11220010111005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11220010111005 is a deficient number, since it is larger than the sum of its proper divisors (7855651329123).
11220010111005 is a wasteful number, since it uses less digits than its factorization.
11220010111005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156584077.
The product of its (nonzero) digits is 20, while the sum is 15.
Adding to 11220010111005 its reverse (50011101002211), we get a palindrome (61231111113216).
The spelling of 11220010111005 in words is "eleven trillion, two hundred twenty billion, ten million, one hundred eleven thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •