Base | Representation |
---|---|
bin | 1010010000000000011110… |
… | …0110101000100011100000 |
3 | 1110220102011011101111010101 |
4 | 2210000013212220203200 |
5 | 2434122202132042200 |
6 | 35545231130112144 |
7 | 2242145060201401 |
oct | 244000746504340 |
9 | 43812134344111 |
10 | 11270121752800 |
11 | 36556a4a10929 |
12 | 1320284b7b654 |
13 | 6399ca179541 |
14 | 2ad6964c39a8 |
15 | 148265c8e26a |
hex | a40079a88e0 |
11270121752800 has 144 divisors (see below), whose sum is σ = 30398199828192. Its totient is φ = 4058396672000.
The previous prime is 11270121752759. The next prime is 11270121752803. The reversal of 11270121752800 is 825712107211.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 11270121752800.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11270121752803) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 17702101 + ... + 18327700.
It is an arithmetic number, because the mean of its divisors is an integer number (211098609918).
Almost surely, 211270121752800 is an apocalyptic number.
11270121752800 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11270121752800 is an abundant number, since it is smaller than the sum of its proper divisors (19128078075392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11270121752800 is a wasteful number, since it uses less digits than its factorization.
11270121752800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36029861 (or 36029848 counting only the distinct ones).
The product of its (nonzero) digits is 15680, while the sum is 37.
The spelling of 11270121752800 in words is "eleven trillion, two hundred seventy billion, one hundred twenty-one million, seven hundred fifty-two thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •