Base | Representation |
---|---|
bin | 1010000011010101111111… |
… | …1111100001100001001010 |
3 | 1110010121121000002102112212 |
4 | 2200311133333201201022 |
5 | 2422041121200343430 |
6 | 35301250535305122 |
7 | 2220343526204135 |
oct | 240653777414112 |
9 | 43117530072485 |
10 | 11052561340490 |
11 | 3581401811a8a |
12 | 12a608851b1a2 |
13 | 622337a1c367 |
14 | 2a2d3812321c |
15 | 142780d44b95 |
hex | a0d5ffe184a |
11052561340490 has 32 divisors (see below), whose sum is σ = 20612152166400. Its totient is φ = 4262623315200.
The previous prime is 11052561340489. The next prime is 11052561340519. The reversal of 11052561340490 is 9404316525011.
It is a super-2 number, since 2×110525613404902 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 65697215 + ... + 65865234.
It is an arithmetic number, because the mean of its divisors is an integer number (644129755200).
Almost surely, 211052561340490 is an apocalyptic number.
11052561340490 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11052561340490 is a deficient number, since it is larger than the sum of its proper divisors (9559590825910).
11052561340490 is a wasteful number, since it uses less digits than its factorization.
11052561340490 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131562758.
The product of its (nonzero) digits is 129600, while the sum is 41.
The spelling of 11052561340490 in words is "eleven trillion, fifty-two billion, five hundred sixty-one million, three hundred forty thousand, four hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •