Base | Representation |
---|---|
bin | 1010000010111100000011… |
… | …0011011110111010111000 |
3 | 1110002221121112220011010120 |
4 | 2200233000303132322320 |
5 | 2421432334440430410 |
6 | 35254135424213240 |
7 | 2220006104550003 |
oct | 240570063367270 |
9 | 43087545804116 |
10 | 11045595639480 |
11 | 3579457864796 |
12 | 12a486376a220 |
13 | 62179786509c |
14 | 2a2876d7453a |
15 | 1424c4553570 |
hex | a0bc0cdeeb8 |
11045595639480 has 64 divisors (see below), whose sum is σ = 34880828342400. Its totient is φ = 2790466266240.
The previous prime is 11045595639443. The next prime is 11045595639493. The reversal of 11045595639480 is 8493659554011.
11045595639480 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (60).
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, 2422277466 + ... + 2422282025.
It is an arithmetic number, because the mean of its divisors is an integer number (545012942850).
Almost surely, 211045595639480 is an apocalyptic number.
11045595639480 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11045595639480 is an abundant number, since it is smaller than the sum of its proper divisors (23835232702920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11045595639480 is a wasteful number, since it uses less digits than its factorization.
11045595639480 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4844559524 (or 4844559520 counting only the distinct ones).
The product of its (nonzero) digits is 23328000, while the sum is 60.
The spelling of 11045595639480 in words is "eleven trillion, forty-five billion, five hundred ninety-five million, six hundred thirty-nine thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •