Base | Representation |
---|---|
bin | 1010000011100001010101… |
… | …1110000000000100001000 |
3 | 1110010220110012011110111000 |
4 | 2200320111132000010020 |
5 | 2422113340114143044 |
6 | 35302513021135000 |
7 | 2220512136346056 |
oct | 240702536000410 |
9 | 43126405143430 |
10 | 11055606006024 |
11 | 358272440a298 |
12 | 12a67980ba460 |
13 | 622701741bb8 |
14 | 2a31466351d6 |
15 | 1428ad2acd69 |
hex | a0e15780108 |
11055606006024 has 32 divisors (see below), whose sum is σ = 30710016684000. Its totient is φ = 3685202001936.
The previous prime is 11055606006007. The next prime is 11055606006047. The reversal of 11055606006024 is 42060060655011.
11055606006024 is a `hidden beast` number, since 1 + 10 + 5 + 560 + 6 + 0 + 0 + 60 + 24 = 666.
It is a super-2 number, since 2×110556060060242 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 11055606006024.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25591680354 + ... + 25591680785.
It is an arithmetic number, because the mean of its divisors is an integer number (959688021375).
Almost surely, 211055606006024 is an apocalyptic number.
It is an amenable number.
11055606006024 is an abundant number, since it is smaller than the sum of its proper divisors (19654410677976).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11055606006024 is a wasteful number, since it uses less digits than its factorization.
11055606006024 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51183361154 (or 51183361144 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 36.
The spelling of 11055606006024 in words is "eleven trillion, fifty-five billion, six hundred six million, six thousand, twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •