Base | Representation |
---|---|
bin | 10000001010110011011… |
… | …000100001000111001000 |
3 | 10221012222020120200202112 |
4 | 100022303120201013020 |
5 | 121201023421023422 |
6 | 2210234251121452 |
7 | 143163240420332 |
oct | 20126330410710 |
9 | 3835866520675 |
10 | 1111111111112 |
11 | 39924628a252 |
12 | 15b410a43288 |
13 | 80a14a36932 |
14 | 3bac701c452 |
15 | 1dd8118bee2 |
hex | 102b36211c8 |
1111111111112 has 16 divisors (see below), whose sum is σ = 2173913043840. Its totient is φ = 531400966096.
The previous prime is 1111111111093. The next prime is 1111111111139. The reversal of 1111111111112 is 2111111111111.
It is a nude number because it is divisible by every one of its digits and also a Zuckerman number because it is divisible by the product of its digits.
It is a plaindrome in base 10.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3019323488 + ... + 3019323855.
It is an arithmetic number, because the mean of its divisors is an integer number (135869565240).
Almost surely, 21111111111112 is an apocalyptic number.
It is an amenable number.
1111111111112 is a deficient number, since it is larger than the sum of its proper divisors (1062801932728).
1111111111112 is a wasteful number, since it uses less digits than its factorization.
1111111111112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6038647372 (or 6038647368 counting only the distinct ones).
The product of its digits is 2, while the sum is 14.
Adding to 1111111111112 its reverse (2111111111111), we get a palindrome (3222222222223).
Subtracting 1111111111112 from its reverse (2111111111111), we obtain a palindrome (999999999999).
It can be divided in two parts, 111111111111 and 2, that multiplied together give a palindrome (222222222222).
The spelling of 1111111111112 in words is "one trillion, one hundred eleven billion, one hundred eleven million, one hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •