Base | Representation |
---|---|
bin | 10000000000101111001… |
… | …011010001011110100111 |
3 | 10220012002000102110100221 |
4 | 100000233023101132213 |
5 | 121011410044041403 |
6 | 2201250002145211 |
7 | 142331352065206 |
oct | 20005713213647 |
9 | 3805060373327 |
10 | 1100303112103 |
11 | 3946aa470668 |
12 | 1592b5352207 |
13 | 7c9b1825750 |
14 | 3b37d84b23d |
15 | 1d94c3c6dbd |
hex | 1002f2d17a7 |
1100303112103 has 16 divisors (see below), whose sum is σ = 1202759663616. Its totient is φ = 1000395300960.
The previous prime is 1100303112061. The next prime is 1100303112163. The reversal of 1100303112103 is 3012113030011.
It is a cyclic number.
It is not a de Polignac number, because 1100303112103 - 221 = 1100301014951 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100303112163) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 8463450 + ... + 8592472.
It is an arithmetic number, because the mean of its divisors is an integer number (75172478976).
Almost surely, 21100303112103 is an apocalyptic number.
1100303112103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1100303112103 is a deficient number, since it is larger than the sum of its proper divisors (102456551513).
1100303112103 is a wasteful number, since it uses less digits than its factorization.
1100303112103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138894.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 1100303112103 its reverse (3012113030011), we get a palindrome (4112416142114).
The spelling of 1100303112103 in words is "one trillion, one hundred billion, three hundred three million, one hundred twelve thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •