Base | Representation |
---|---|
bin | 110011101111010101… |
… | …1011001010000110100 |
3 | 101121210110020220022122 |
4 | 1213132223121100310 |
5 | 3310023141200040 |
6 | 123013203015112 |
7 | 11012261160443 |
oct | 1473653312064 |
9 | 347713226278 |
10 | 111110100020 |
11 | 43137833747 |
12 | 1964a66a498 |
13 | a6294a5b1a |
14 | 55407d0d5a |
15 | 2d547c61b5 |
hex | 19dead9434 |
111110100020 has 24 divisors (see below), whose sum is σ = 234515640744. Its totient is φ = 44218434176.
The previous prime is 111110099929. The next prime is 111110100041. The reversal of 111110100020 is 20001011111.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 13242485776 + 97867614244 = 115076^2 + 312838^2 .
It is a junction number, because it is equal to n+sod(n) for n = 111110099980 and 111110100007.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14096327 + ... + 14104206.
It is an arithmetic number, because the mean of its divisors is an integer number (9771485031).
Almost surely, 2111110100020 is an apocalyptic number.
111110100020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
111110100020 is an abundant number, since it is smaller than the sum of its proper divisors (123405540724).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111110100020 is a wasteful number, since it uses less digits than its factorization.
111110100020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28200739 (or 28200737 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 111110100020 its reverse (20001011111), we get a palindrome (131111111131).
The spelling of 111110100020 in words is "one hundred eleven billion, one hundred ten million, one hundred thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •