Base | Representation |
---|---|
bin | 1010000000111110111001… |
… | …0111000011100111110000 |
3 | 1102222201220020011001122201 |
4 | 2200033232113003213300 |
5 | 2420410034022414300 |
6 | 35230502033312544 |
7 | 2214406426205545 |
oct | 240175627034760 |
9 | 42881806131581 |
10 | 11012000201200 |
11 | 3566188038769 |
12 | 129a248705754 |
13 | 61b57262931b |
14 | 2a0dab206bcc |
15 | 1416a9e6966a |
hex | a03ee5c39f0 |
11012000201200 has 60 divisors (see below), whose sum is σ = 26462865192088. Its totient is φ = 4403712096000.
The previous prime is 11012000201159. The next prime is 11012000201207. The reversal of 11012000201200 is 210200021011.
11012000201200 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 (11012000201207) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1777527 + ... + 5018326.
Almost surely, 211012000201200 is an apocalyptic number.
11012000201200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11012000201200 is an abundant number, since it is smaller than the sum of its proper divisors (15450864990888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11012000201200 is a wasteful number, since it uses less digits than its factorization.
11012000201200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6799922 (or 6799911 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 11012000201200 its reverse (210200021011), we get a palindrome (11222200222211).
The spelling of 11012000201200 in words is "eleven trillion, twelve billion, two hundred one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •