Base | Representation |
---|---|
bin | 11001010000110111010000… |
… | …001001011011000001001000 |
3 | 112120102000100000110122010111 |
4 | 121100313100021123001020 |
5 | 104030411240241023422 |
6 | 1032151121351524104 |
7 | 32255301256344463 |
oct | 3120672011330110 |
9 | 476360300418114 |
10 | 111110001111112 |
11 | 32448539aa4a73 |
12 | 10565a42689634 |
13 | 49cc822065853 |
14 | 1d61a7777a2da |
15 | cca35d1e0a77 |
hex | 650dd025b048 |
111110001111112 has 48 divisors (see below), whose sum is σ = 212688459785340. Its totient is φ = 54397509259392.
The previous prime is 111110001111089. The next prime is 111110001111119. The reversal of 111110001111112 is 211111100011111.
It can be written as a sum of positive squares in 2 ways, for example, as 98151541865316 + 12958459245796 = 9907146^2 + 3599786^2 .
It is a super-2 number, since 2×1111100011111122 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 111110001111092 and 111110001111101.
It is not an unprimeable number, because it can be changed into a prime (111110001111119) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 105050218 + ... + 106102630.
Almost surely, 2111110001111112 is an apocalyptic number.
It is an amenable number.
111110001111112 is a deficient number, since it is larger than the sum of its proper divisors (101578458674228).
111110001111112 is an equidigital number, since it uses as much as digits as its factorization.
111110001111112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1053470 (or 1052967 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 13.
Adding to 111110001111112 its reverse (211111100011111), we get a palindrome (322221101122223).
The spelling of 111110001111112 in words is "one hundred eleven trillion, one hundred ten billion, one million, one hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •