Base | Representation |
---|---|
bin | 11001001111100011100010… |
… | …011001100100010001111110 |
3 | 112120002102022120011111011220 |
4 | 121033203202121210101332 |
5 | 104022423142413120110 |
6 | 1032041534050054210 |
7 | 32245636616233134 |
oct | 3117434231442176 |
9 | 476072276144156 |
10 | 111020113020030 |
11 | 32413402569795 |
12 | 1055053727a366 |
13 | 49c41c8496786 |
14 | 1d5b58b68d754 |
15 | cc7d4babc370 |
hex | 64f8e266447e |
111020113020030 has 64 divisors (see below), whose sum is σ = 266504526908928. Its totient is φ = 29599113640320.
The previous prime is 111020113019999. The next prime is 111020113020071. The reversal of 111020113020030 is 30020311020111.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a junction number, because it is equal to n+sod(n) for n = 111020113019991 and 111020113020009.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5171653357 + ... + 5171674823.
It is an arithmetic number, because the mean of its divisors is an integer number (4164133232952).
Almost surely, 2111020113020030 is an apocalyptic number.
111020113020030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
111020113020030 is an abundant number, since it is smaller than the sum of its proper divisors (155484413888898).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111020113020030 is a wasteful number, since it uses less digits than its factorization.
111020113020030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49841.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 111020113020030 its reverse (30020311020111), we get a palindrome (141040424040141).
The spelling of 111020113020030 in words is "one hundred eleven trillion, twenty billion, one hundred thirteen million, twenty thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •