Base | Representation |
---|---|
bin | 110011111000011101… |
… | …1110001101010101100 |
3 | 101122120210120202012010 |
4 | 1213300323301222230 |
5 | 3311140043243142 |
6 | 123103423441220 |
7 | 11023000432242 |
oct | 1476073615254 |
9 | 348523522163 |
10 | 111416384172 |
11 | 4328470a545 |
12 | 19715156210 |
13 | a677a94052 |
14 | 556d35c792 |
15 | 2d71626e9c |
hex | 19f0ef1aac |
111416384172 has 24 divisors (see below), whose sum is σ = 260073544192. Its totient is φ = 37124226000.
The previous prime is 111416384147. The next prime is 111416384263. The reversal of 111416384172 is 271483614111.
111416384172 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1114163841722 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 111416384172.
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, 1789204 + ... + 1850427.
Almost surely, 2111416384172 is an apocalyptic number.
111416384172 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
111416384172 is an abundant number, since it is smaller than the sum of its proper divisors (148657160020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111416384172 is a wasteful number, since it uses less digits than its factorization.
111416384172 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3642189 (or 3642187 counting only the distinct ones).
The product of its digits is 32256, while the sum is 39.
Adding to 111416384172 its reverse (271483614111), we get a palindrome (382899998283).
The spelling of 111416384172 in words is "one hundred eleven billion, four hundred sixteen million, three hundred eighty-four thousand, one hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •