Base | Representation |
---|---|
bin | 10000001010101101010… |
… | …110111000101010100000 |
3 | 10221012201012100201211021 |
4 | 100022231112320222200 |
5 | 121200322031120000 |
6 | 2210220240255224 |
7 | 143160602232136 |
oct | 20125526705240 |
9 | 3835635321737 |
10 | 1111010020000 |
11 | 3991a4212a81 |
12 | 15b3a3011514 |
13 | 809c9b005ca |
14 | 3bab7825756 |
15 | 1dd7736e11a |
hex | 102ad5b8aa0 |
1111010020000 has 60 divisors (see below), whose sum is σ = 2733251349906. Its totient is φ = 444404000000.
The previous prime is 1111010019967. The next prime is 1111010020073. The reversal of 1111010020000 is 200101111.
It can be written as a sum of positive squares in 5 ways, for example, as 62606044944 + 1048403975056 = 250212^2 + 1023916^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 27755251 + ... + 27795250.
Almost surely, 21111010020000 is an apocalyptic number.
1111010020000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1111010020000 is an abundant number, since it is smaller than the sum of its proper divisors (1622241329906).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1111010020000 is an frugal number, since it uses more digits than its factorization.
1111010020000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55550531 (or 55550508 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 1111010020000 its reverse (200101111), we get a palindrome (1111210121111).
The spelling of 1111010020000 in words is "one trillion, one hundred eleven billion, ten million, twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •