Base | Representation |
---|---|
bin | 110011101111000110… |
… | …1010001010110111000 |
3 | 101121202220101201002021 |
4 | 1213132031101112320 |
5 | 3310014131001240 |
6 | 123012321444224 |
7 | 11012134101133 |
oct | 1473615212670 |
9 | 347686351067 |
10 | 111102203320 |
11 | 4313332a849 |
12 | 19647aa0674 |
13 | a62796c714 |
14 | 553d73721a |
15 | 2d53c6654a |
hex | 19de3515b8 |
111102203320 has 16 divisors (see below), whose sum is σ = 249979957560. Its totient is φ = 44440881312.
The previous prime is 111102203309. The next prime is 111102203323. The reversal of 111102203320 is 23302201111.
111102203320 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 111102203294 and 111102203303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111102203323) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1388777502 + ... + 1388777581.
Almost surely, 2111102203320 is an apocalyptic number.
111102203320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
111102203320 is an abundant number, since it is smaller than the sum of its proper divisors (138877754240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111102203320 is a wasteful number, since it uses less digits than its factorization.
111102203320 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2777555094 (or 2777555090 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 111102203320 its reverse (23302201111), we get a palindrome (134404404431).
The spelling of 111102203320 in words is "one hundred eleven billion, one hundred two million, two hundred three thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •