Base | Representation |
---|---|
bin | 10000000100011001010… |
… | …011000001101010001011 |
3 | 10220120012202110111110001 |
4 | 100010121103001222023 |
5 | 121042431114404003 |
6 | 2203135434503431 |
7 | 142530605513266 |
oct | 20043123015213 |
9 | 3816182414401 |
10 | 1104231013003 |
11 | 39633568a758 |
12 | 15a010894b77 |
13 | 80189522071 |
14 | 3b633393cdd |
15 | 1dacc15961d |
hex | 101194c1a8b |
1104231013003 has 8 divisors (see below), whose sum is σ = 1163785222800. Its totient is φ = 1044820482048.
The previous prime is 1104231012991. The next prime is 1104231013013. The reversal of 1104231013003 is 3003101324011.
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 1104231013003 - 29 = 1104231012491 is a prime.
It is a super-2 number, since 2×11042310130032 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1104231013013) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 35903926 + ... + 35934667.
It is an arithmetic number, because the mean of its divisors is an integer number (145473152850).
Almost surely, 21104231013003 is an apocalyptic number.
1104231013003 is a deficient number, since it is larger than the sum of its proper divisors (59554209797).
1104231013003 is an equidigital number, since it uses as much as digits as its factorization.
1104231013003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71839421.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 1104231013003 its reverse (3003101324011), we get a palindrome (4107332337014).
The spelling of 1104231013003 in words is "one trillion, one hundred four billion, two hundred thirty-one million, thirteen thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •