Base | Representation |
---|---|
bin | 1010000000101010011111… |
… | …0111010101010001111001 |
3 | 1102222012202110220122101122 |
4 | 2200022213313111101321 |
5 | 2420312324230400010 |
6 | 35224154315355025 |
7 | 2214123613500632 |
oct | 240124767252171 |
9 | 42865673818348 |
10 | 11006522512505 |
11 | 3563927023113 |
12 | 129917a152a75 |
13 | 61abab827b00 |
14 | 2a0a0b91a889 |
15 | 141489105855 |
hex | a02a7dd5479 |
11006522512505 has 48 divisors (see below), whose sum is σ = 14636021492160. Its totient is φ = 7939399613184.
The previous prime is 11006522512499. The next prime is 11006522512511. The reversal of 11006522512505 is 50521522560011.
11006522512505 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (11006522512499) and next prime (11006522512511).
It is not a de Polignac number, because 11006522512505 - 226 = 11006455403641 is a prime.
It is a super-2 number, since 2×110065225125052 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 9624866 + ... + 10707524.
It is an arithmetic number, because the mean of its divisors is an integer number (304917114420).
Almost surely, 211006522512505 is an apocalyptic number.
It is an amenable number.
11006522512505 is a deficient number, since it is larger than the sum of its proper divisors (3629498979655).
11006522512505 is a wasteful number, since it uses less digits than its factorization.
11006522512505 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1082970 (or 1082957 counting only the distinct ones).
The product of its (nonzero) digits is 30000, while the sum is 35.
The spelling of 11006522512505 in words is "eleven trillion, six billion, five hundred twenty-two million, five hundred twelve thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •