Base | Representation |
---|---|
bin | 1010000011100000101001… |
… | …1101000011001111000000 |
3 | 1110010212222022102201112210 |
4 | 2200320022131003033000 |
5 | 2422113000312114423 |
6 | 35302442420222120 |
7 | 2220504433523610 |
oct | 240701235031700 |
9 | 43125868381483 |
10 | 11055421207488 |
11 | 358263a06a429 |
12 | 12a674623a940 |
13 | 6226a237ab58 |
14 | 2a3129c8ca40 |
15 | 14289be57b93 |
hex | a0e0a7433c0 |
11055421207488 has 112 divisors (see below), whose sum is σ = 33453948132864. Its totient is φ = 3156380574720.
The previous prime is 11055421207487. The next prime is 11055421207511. The reversal of 11055421207488 is 88470212455011.
It is a tau number, because it is divible by the number of its divisors (112).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11055421207487) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1171443 + ... + 4845938.
It is an arithmetic number, because the mean of its divisors is an integer number (298695965472).
Almost surely, 211055421207488 is an apocalyptic number.
It is an amenable number.
11055421207488 is an abundant number, since it is smaller than the sum of its proper divisors (22398526925376).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11055421207488 is a wasteful number, since it uses less digits than its factorization.
11055421207488 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6018770 (or 6018760 counting only the distinct ones).
The product of its (nonzero) digits is 716800, while the sum is 48.
The spelling of 11055421207488 in words is "eleven trillion, fifty-five billion, four hundred twenty-one million, two hundred seven thousand, four hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •