Base | Representation |
---|---|
bin | 1010000000101010011100… |
… | …1000100010100010011000 |
3 | 1102222012201121211102222010 |
4 | 2200022213020202202120 |
5 | 2420312313110333130 |
6 | 35224153200425520 |
7 | 2214123404311431 |
oct | 240124710424230 |
9 | 42865647742863 |
10 | 11006510246040 |
11 | 3563920105141 |
12 | 12991760182a0 |
13 | 61aba912174a |
14 | 2a0a0a046488 |
15 | 141487ed10b0 |
hex | a02a7222898 |
11006510246040 has 64 divisors (see below), whose sum is σ = 33019879332960. Its totient is φ = 2935038412800.
The previous prime is 11006510245999. The next prime is 11006510246047. The reversal of 11006510246040 is 4064201560011.
It is a super-2 number, since 2×110065102460402 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 11006510245989 and 11006510246007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11006510246047) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12339090 + ... + 13200990.
Almost surely, 211006510246040 is an apocalyptic number.
11006510246040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11006510246040 is an abundant number, since it is smaller than the sum of its proper divisors (22013369086920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11006510246040 is a wasteful number, since it uses less digits than its factorization.
11006510246040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 968332 (or 968328 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 30.
The spelling of 11006510246040 in words is "eleven trillion, six billion, five hundred ten million, two hundred forty-six thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.700 sec. • engine limits •