Base | Representation |
---|---|
bin | 10000000010011010011… |
… | …010010000001100010111 |
3 | 10220100201101201122112011 |
4 | 100002122122100030113 |
5 | 121024101130413421 |
6 | 2202144311005051 |
7 | 142424056066522 |
oct | 20023232201427 |
9 | 3810641648464 |
10 | 1102102201111 |
11 | 395442a6288a |
12 | 159717969787 |
13 | 7cc0a486c62 |
14 | 3b4b0767bb9 |
15 | 1da053004e1 |
hex | 1009a690317 |
1102102201111 has 16 divisors (see below), whose sum is σ = 1121582112480. Its totient is φ = 1082783116800.
The previous prime is 1102102201073. The next prime is 1102102201129. The reversal of 1102102201111 is 1111022012011.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1102102201111 - 223 = 1102093812503 is a prime.
It is a super-2 number, since 2×11021022011112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1102102201091 and 1102102201100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102102201181) 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, 111307261 + ... + 111317161.
It is an arithmetic number, because the mean of its divisors is an integer number (70098882030).
Almost surely, 21102102201111 is an apocalyptic number.
1102102201111 is a deficient number, since it is larger than the sum of its proper divisors (19479911369).
1102102201111 is an equidigital number, since it uses as much as digits as its factorization.
1102102201111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17826.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1102102201111 its reverse (1111022012011), we get a palindrome (2213124213122).
The spelling of 1102102201111 in words is "one trillion, one hundred two billion, one hundred two million, two hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.722 sec. • engine limits •