Base | Representation |
---|---|
bin | 1010000011100001010100… |
… | …1001000010010000110101 |
3 | 1110010220102210211020100202 |
4 | 2200320111021002100311 |
5 | 2422113332212310010 |
6 | 35302512303250245 |
7 | 2220512041545512 |
oct | 240702511022065 |
9 | 43126383736322 |
10 | 11055600510005 |
11 | 35827212a6027 |
12 | 12a67962a9985 |
13 | 62270056940c |
14 | 2a3145a04309 |
15 | 1428aca746a5 |
hex | a0e15242435 |
11055600510005 has 16 divisors (see below), whose sum is σ = 14095721910960. Its totient is φ = 8324216836096.
The previous prime is 11055600509963. The next prime is 11055600510023. The reversal of 11055600510005 is 50001500655011.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 1440782506276 + 9614818003729 = 1200326^2 + 3100777^2 .
It is not a de Polignac number, because 11055600510005 - 220 = 11055599461429 is a prime.
It is a super-2 number, since 2×110556005100052 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11055600510005.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 225002924 + ... + 225052053.
It is an arithmetic number, because the mean of its divisors is an integer number (880982619435).
Almost surely, 211055600510005 is an apocalyptic number.
It is an amenable number.
11055600510005 is a deficient number, since it is larger than the sum of its proper divisors (3040121400955).
11055600510005 is an frugal number, since it uses more digits than its factorization.
11055600510005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 450055033 (or 450054999 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 29.
The spelling of 11055600510005 in words is "eleven trillion, fifty-five billion, six hundred million, five hundred ten thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •