Base | Representation |
---|---|
bin | 10000000001011111011… |
… | …001010111000001100010 |
3 | 10220021011101200212111112 |
4 | 100001133121113001202 |
5 | 121020034200024302 |
6 | 2201502141543322 |
7 | 142360404342155 |
oct | 20013731270142 |
9 | 3807141625445 |
10 | 1101112111202 |
11 | 394a85098664 |
12 | 1594a0274b42 |
13 | 7cab030973c |
14 | 3b419079c9c |
15 | 1d99842a552 |
hex | 1005f657062 |
1101112111202 has 8 divisors (see below), whose sum is σ = 1658521562412. Its totient is φ = 548271590400.
The previous prime is 1101112111199. The next prime is 1101112111207. The reversal of 1101112111202 is 2021112111011.
It can be written as a sum of positive squares in 2 ways, for example, as 1079772452641 + 21339658561 = 1039121^2 + 146081^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×11011121112022 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1101112111207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1142231999 + ... + 1142232962.
Almost surely, 21101112111202 is an apocalyptic number.
1101112111202 is a deficient number, since it is larger than the sum of its proper divisors (557409451210).
1101112111202 is a wasteful number, since it uses less digits than its factorization.
1101112111202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2284465204.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 1101112111202 its reverse (2021112111011), we get a palindrome (3122224222213).
The spelling of 1101112111202 in words is "one trillion, one hundred one billion, one hundred twelve million, one hundred eleven thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •