Base | Representation |
---|---|
bin | 1010000111010001010011… |
… | …0101111011100001100110 |
3 | 1110101001201022110221220002 |
4 | 2201310110311323201212 |
5 | 2424142300110323420 |
6 | 35352244444541302 |
7 | 2225252314352213 |
oct | 241642465734146 |
9 | 43331638427802 |
10 | 11120020011110 |
11 | 35a7a7944173a |
12 | 12b7174251832 |
13 | 6287c87c68ca |
14 | 2a62d740ab0a |
15 | 1443cd2b4075 |
hex | a1d14d7b866 |
11120020011110 has 8 divisors (see below), whose sum is σ = 20016036020016. Its totient is φ = 4448008004440.
The previous prime is 11120020011101. The next prime is 11120020011173. The reversal of 11120020011110 is 1111002002111.
11120020011110 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 11120020011091 and 11120020011100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 556001000546 + ... + 556001000565.
It is an arithmetic number, because the mean of its divisors is an integer number (2502004502502).
Almost surely, 211120020011110 is an apocalyptic number.
11120020011110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11120020011110 is a deficient number, since it is larger than the sum of its proper divisors (8896016008906).
11120020011110 is a wasteful number, since it uses less digits than its factorization.
11120020011110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1112002001118.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 11120020011110 its reverse (1111002002111), we get a palindrome (12231022013221).
The spelling of 11120020011110 in words is "eleven trillion, one hundred twenty billion, twenty million, eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •