Base | Representation |
---|---|
bin | 11001010000110111010000… |
… | …010001011110001000100110 |
3 | 112120102000100011102211101121 |
4 | 121100313100101132020212 |
5 | 104030411241311033110 |
6 | 1032151121505044154 |
7 | 32255301313313032 |
oct | 3120672021361046 |
9 | 476360304384347 |
10 | 111110003221030 |
11 | 32448540206200 |
12 | 10565a4332665a |
13 | 49cc822624018 |
14 | 1d61a77b691c2 |
15 | cca35d4aacda |
hex | 650dd045e226 |
111110003221030 has 48 divisors (see below), whose sum is σ = 231402651384240. Its totient is φ = 38277130288320.
The previous prime is 111110003221027. The next prime is 111110003221069. The reversal of 111110003221030 is 30122300011111.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 111110003220995 and 111110003221013.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2416462509 + ... + 2416508488.
It is an arithmetic number, because the mean of its divisors is an integer number (4820888570505).
Almost surely, 2111110003221030 is an apocalyptic number.
111110003221030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
111110003221030 is an abundant number, since it is smaller than the sum of its proper divisors (120292648163210).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111110003221030 is a wasteful number, since it uses less digits than its factorization.
111110003221030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4832971045 (or 4832971034 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 111110003221030 its reverse (30122300011111), we get a palindrome (141232303232141).
The spelling of 111110003221030 in words is "one hundred eleven trillion, one hundred ten billion, three million, two hundred twenty-one thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.149 sec. • engine limits •