Base | Representation |
---|---|
bin | 1010000001011101011110… |
… | …1101011010010101000000 |
3 | 1110000112002101120011000101 |
4 | 2200113113231122111000 |
5 | 2421023342242320000 |
6 | 35234340432332144 |
7 | 2215120036314064 |
oct | 240272755322500 |
9 | 43015071504011 |
10 | 11020210120000 |
11 | 3569710353224 |
12 | 129b95a0a4054 |
13 | 61c2804ba343 |
14 | 2a1549715aa4 |
15 | 1419daacce6a |
hex | a05d7b5a540 |
11020210120000 has 70 divisors (see below), whose sum is σ = 27326539628498. Its totient is φ = 4408084032000.
The previous prime is 11020210119977. The next prime is 11020210120001. The reversal of 11020210120000 is 2101202011.
It can be written as a sum of positive squares in 5 ways, for example, as 4141843663104 + 6878366456896 = 2035152^2 + 2622664^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11020210120001) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 137712627 + ... + 137792626.
Almost surely, 211020210120000 is an apocalyptic number.
11020210120000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11020210120000 is an abundant number, since it is smaller than the sum of its proper divisors (16306329508498).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11020210120000 is an frugal number, since it uses more digits than its factorization.
11020210120000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 275505285 (or 275505260 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 11020210120000 its reverse (2101202011), we get a palindrome (11022311322011).
The spelling of 11020210120000 in words is "eleven trillion, twenty billion, two hundred ten million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •