Base | Representation |
---|---|
bin | 10000000010011010111… |
… | …100001111011101100100 |
3 | 10220100202000111022121111 |
4 | 100002122330033131210 |
5 | 121024110421023022 |
6 | 2202145225554404 |
7 | 142424224606102 |
oct | 20023274173544 |
9 | 3810660438544 |
10 | 1102111111012 |
11 | 395447a98a3a |
12 | 15971a945a04 |
13 | 7cc0c2865a2 |
14 | 3b4b1a06c72 |
15 | 1da05eb0477 |
hex | 1009af0f764 |
1102111111012 has 12 divisors (see below), whose sum is σ = 2030204678320. Its totient is φ = 522052631496.
The previous prime is 1102111110973. The next prime is 1102111111033. The reversal of 1102111111012 is 2101111112011.
It is a super-2 number, since 2×11021111110122 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1102111110983 and 1102111111001.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7250730918 + ... + 7250731069.
Almost surely, 21102111111012 is an apocalyptic number.
It is an amenable number.
1102111111012 is a deficient number, since it is larger than the sum of its proper divisors (928093567308).
1102111111012 is a wasteful number, since it uses less digits than its factorization.
1102111111012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14501462010 (or 14501462008 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 1102111111012 its reverse (2101111112011), we get a palindrome (3203222223023).
Subtracting 1102111111012 from its reverse (2101111112011), we obtain a palindrome (999000000999).
The spelling of 1102111111012 in words is "one trillion, one hundred two billion, one hundred eleven million, one hundred eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •