Base | Representation |
---|---|
bin | 1010000110001110100111… |
… | …1010110100001000110100 |
3 | 1110022100111211110021201102 |
4 | 2201203221322310020310 |
5 | 2423344120210031400 |
6 | 35340124333345232 |
7 | 2224046611654061 |
oct | 241435172641064 |
9 | 43270454407642 |
10 | 11102120002100 |
11 | 35a0423344a66 |
12 | 12b37b9638218 |
13 | 626c052059ba |
14 | 2a54b9dabc68 |
15 | 143bd1aac9d5 |
hex | a18e9eb4234 |
11102120002100 has 36 divisors (see below), whose sum is σ = 24194997881964. Its totient is φ = 4421788558080.
The previous prime is 11102120002093. The next prime is 11102120002121. The reversal of 11102120002100 is 120002120111.
It can be written as a sum of positive squares in 6 ways, for example, as 10169512336 + 11091950489764 = 100844^2 + 3330458^2 .
It is a congruent number.
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, 238219619 + ... + 238266218.
It is an arithmetic number, because the mean of its divisors is an integer number (672083274499).
Almost surely, 211102120002100 is an apocalyptic number.
11102120002100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11102120002100 is an abundant number, since it is smaller than the sum of its proper divisors (13092877879864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11102120002100 is a wasteful number, since it uses less digits than its factorization.
11102120002100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 476486084 (or 476486077 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 11102120002100 its reverse (120002120111), we get a palindrome (11222122122211).
The spelling of 11102120002100 in words is "eleven trillion, one hundred two billion, one hundred twenty million, two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •