Base | Representation |
---|---|
bin | 10000000000011110010… |
… | …111110111010010000000 |
3 | 10220011100100221211122221 |
4 | 100000132113313102000 |
5 | 121010320411400000 |
6 | 2201202011540424 |
7 | 142321356632062 |
oct | 20003627672200 |
9 | 3804310854587 |
10 | 1100021200000 |
11 | 394575320958 |
12 | 159236a5a714 |
13 | 7c9682bb958 |
14 | 3b354225732 |
15 | 1d93278c61a |
hex | 1001e5f7480 |
1100021200000 has 96 divisors (see below), whose sum is σ = 2739136285620. Its totient is φ = 440008320000.
The previous prime is 1100021199983. The next prime is 1100021200013. The reversal of 1100021200000 is 21200011.
It can be written as a sum of positive squares in 6 ways, for example, as 358572096 + 1099662627904 = 18936^2 + 1048648^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 975027 + ... + 1775026.
Almost surely, 21100021200000 is an apocalyptic number.
1100021200000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1100021200000 is an abundant number, since it is smaller than the sum of its proper divisors (1639115085620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1100021200000 is an frugal number, since it uses more digits than its factorization.
1100021200000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2750092 (or 2750060 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 7.
Adding to 1100021200000 its reverse (21200011), we get a palindrome (1100042400011).
The spelling of 1100021200000 in words is "one trillion, one hundred billion, twenty-one million, two hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •