Base | Representation |
---|---|
bin | 1010000110001010110100… |
… | …1111111001110010111000 |
3 | 1110022020212220010112010211 |
4 | 2201202231033321302320 |
5 | 2423340024120320440 |
6 | 35335435332520504 |
7 | 2224012442055115 |
oct | 241425517716270 |
9 | 43266786115124 |
10 | 11101102120120 |
11 | 359aa50818191 |
12 | 12b3574780134 |
13 | 626aa237747c |
14 | 2a5420b2790c |
15 | 143b72547eea |
hex | a18ad3f9cb8 |
11101102120120 has 32 divisors (see below), whose sum is σ = 25117018779600. Its totient is φ = 4415633913088.
The previous prime is 11101102120007. The next prime is 11101102120153. The reversal of 11101102120120 is 2102120110111.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 11101102120120.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 775209469 + ... + 775223788.
Almost surely, 211101102120120 is an apocalyptic number.
11101102120120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11101102120120 is an abundant number, since it is smaller than the sum of its proper divisors (14015916659480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11101102120120 is a wasteful number, since it uses less digits than its factorization.
11101102120120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1550433447 (or 1550433443 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11101102120120 its reverse (2102120110111), we get a palindrome (13203222230231).
The spelling of 11101102120120 in words is "eleven trillion, one hundred one billion, one hundred two million, one hundred twenty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •