Base | Representation |
---|---|
bin | 10000000001011111010… |
… | …001011000100001101011 |
3 | 10220021011020202122012010 |
4 | 100001133101120201223 |
5 | 121020033131121303 |
6 | 2201502025051003 |
7 | 142360350513024 |
oct | 20013721304153 |
9 | 3807136678163 |
10 | 1101110020203 |
11 | 394a8399a666 |
12 | 15949b626a63 |
13 | 7caaca56a6b |
14 | 3b418a93c4b |
15 | 1d998165c03 |
hex | 1005f45886b |
1101110020203 has 8 divisors (see below), whose sum is σ = 1554508263888. Its totient is φ = 690892561664.
The previous prime is 1101110020187. The next prime is 1101110020207. The reversal of 1101110020203 is 3020200111011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1101110020203 - 24 = 1101110020187 is a prime.
It is a super-2 number, since 2×11011100202032 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1101110020207) 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 7 ways as a sum of consecutive naturals, for example, 10795196226 + ... + 10795196327.
It is an arithmetic number, because the mean of its divisors is an integer number (194313532986).
Almost surely, 21101110020203 is an apocalyptic number.
1101110020203 is a deficient number, since it is larger than the sum of its proper divisors (453398243685).
1101110020203 is a wasteful number, since it uses less digits than its factorization.
1101110020203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21590392573.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 1101110020203 its reverse (3020200111011), we get a palindrome (4121310131214).
The spelling of 1101110020203 in words is "one trillion, one hundred one billion, one hundred ten million, twenty thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •