Base | Representation |
---|---|
bin | 10000000100011101100… |
… | …110011010001110000011 |
3 | 10220120101210022010210011 |
4 | 100010131212122032003 |
5 | 121043103110000303 |
6 | 2203150534045351 |
7 | 142532443231324 |
oct | 20043546321603 |
9 | 3816353263704 |
10 | 1104303203203 |
11 | 396372407282 |
12 | 15a030aa9857 |
13 | 8019b479765 |
14 | 3b63cbc644b |
15 | 1dad366916d |
hex | 1011d99a383 |
1104303203203 has 16 divisors (see below), whose sum is σ = 1135763532000. Its totient is φ = 1072929024000.
The previous prime is 1104303203197. The next prime is 1104303203209. The reversal of 1104303203203 is 3023023034011.
It is an interprime number because it is at equal distance from previous prime (1104303203197) and next prime (1104303203209).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1104303203203 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1104303203209) 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 15 ways as a sum of consecutive naturals, for example, 81799548 + ... + 81813046.
It is an arithmetic number, because the mean of its divisors is an integer number (70985220750).
Almost surely, 21104303203203 is an apocalyptic number.
1104303203203 is a deficient number, since it is larger than the sum of its proper divisors (31460328797).
1104303203203 is a wasteful number, since it uses less digits than its factorization.
1104303203203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16518.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 1104303203203 its reverse (3023023034011), we get a palindrome (4127326237214).
The spelling of 1104303203203 in words is "one trillion, one hundred four billion, three hundred three million, two hundred three thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •