Base | Representation |
---|---|
bin | 1010000001000100101011… |
… | …0101101100100110111000 |
3 | 1102222212220100122021000200 |
4 | 2200101022311230212320 |
5 | 2420421223221043042 |
6 | 35231320020202200 |
7 | 2214463036066410 |
oct | 240211265544670 |
9 | 42885810567020 |
10 | 11013551737272 |
11 | 3566903918787 |
12 | 129a600239360 |
13 | 61b75bbc3bc6 |
14 | 2a10b72c3640 |
15 | 14174b293c4c |
hex | a044ad6c9b8 |
11013551737272 has 48 divisors (see below), whose sum is σ = 34089564902640. Its totient is φ = 3146729067648.
The previous prime is 11013551737261. The next prime is 11013551737291. The reversal of 11013551737272 is 27273715531011.
11013551737272 is a `hidden beast` number, since 1 + 1 + 0 + 1 + 3 + 551 + 73 + 7 + 27 + 2 = 666.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 10926142093 + ... + 10926143100.
It is an arithmetic number, because the mean of its divisors is an integer number (710199268805).
Almost surely, 211013551737272 is an apocalyptic number.
11013551737272 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11013551737272 is an abundant number, since it is smaller than the sum of its proper divisors (23076013165368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11013551737272 is a wasteful number, since it uses less digits than its factorization.
11013551737272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21852285212 (or 21852285205 counting only the distinct ones).
The product of its (nonzero) digits is 308700, while the sum is 45.
The spelling of 11013551737272 in words is "eleven trillion, thirteen billion, five hundred fifty-one million, seven hundred thirty-seven thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •