Base | Representation |
---|---|
bin | 1010000001100000011111… |
… | …1111101010110001001100 |
3 | 1110000121011211220002201220 |
4 | 2200120013333222301030 |
5 | 2421032022133243200 |
6 | 35234553051403340 |
7 | 2215146104063160 |
oct | 240300777526114 |
9 | 43017154802656 |
10 | 11021020212300 |
11 | 3569a9665759a |
12 | 129bb45453550 |
13 | 61c37c294ab7 |
14 | 2a15c514aca0 |
15 | 141a36c9a4a0 |
hex | a0607feac4c |
11021020212300 has 144 divisors (see below), whose sum is σ = 36783428209920. Its totient is φ = 2495547383040.
The previous prime is 11021020212259. The next prime is 11021020212313. The reversal of 11021020212300 is 321202012011.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 11021020212300.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 24299155 + ... + 24748554.
It is an arithmetic number, because the mean of its divisors is an integer number (255440473680).
Almost surely, 211021020212300 is an apocalyptic number.
11021020212300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11021020212300 is an abundant number, since it is smaller than the sum of its proper divisors (25762407997620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11021020212300 is a wasteful number, since it uses less digits than its factorization.
11021020212300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49047840 (or 49047833 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 11021020212300 its reverse (321202012011), we get a palindrome (11342222224311).
The spelling of 11021020212300 in words is "eleven trillion, twenty-one billion, twenty million, two hundred twelve thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •