Base | Representation |
---|---|
bin | 10000000010011010011… |
… | …010010010101000101000 |
3 | 10220100201101202011020120 |
4 | 100002122122102220220 |
5 | 121024101131223422 |
6 | 2202144311123240 |
7 | 142424056140630 |
oct | 20023232225050 |
9 | 3810641664216 |
10 | 1102102211112 |
11 | 395442a6a351 |
12 | 159717973520 |
13 | 7cc0a48b686 |
14 | 3b4b076b6c0 |
15 | 1da0530345c |
hex | 1009a692a28 |
1102102211112 has 64 divisors (see below), whose sum is σ = 3149757436800. Its totient is φ = 314796948480.
The previous prime is 1102102211083. The next prime is 1102102211113. The reversal of 1102102211112 is 2111122012011.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 1102102211091 and 1102102211100.
It is not an unprimeable number, because it can be changed into a prime (1102102211113) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 336589 + ... + 1522332.
It is an arithmetic number, because the mean of its divisors is an integer number (49214959950).
Almost surely, 21102102211112 is an apocalyptic number.
1102102211112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1102102211112 is an abundant number, since it is smaller than the sum of its proper divisors (2047655225688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1102102211112 is a wasteful number, since it uses less digits than its factorization.
1102102211112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1862466 (or 1862462 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 1102102211112 its reverse (2111122012011), we get a palindrome (3213224223123).
The spelling of 1102102211112 in words is "one trillion, one hundred two billion, one hundred two million, two hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •