Base | Representation |
---|---|
bin | 10000000100011001111… |
… | …011001001110011000111 |
3 | 10220120020111020220221100 |
4 | 100010121323021303013 |
5 | 121042441313011403 |
6 | 2203140452151143 |
7 | 142531064104233 |
oct | 20043173116307 |
9 | 3816214226840 |
10 | 1104241532103 |
11 | 396340614926 |
12 | 15a0143084b3 |
13 | 8018b765c98 |
14 | 3b6349315c3 |
15 | 1dacd0362a3 |
hex | 10119ec9cc7 |
1104241532103 has 12 divisors (see below), whose sum is σ = 1600651647400. Its totient is φ = 733559744016.
The previous prime is 1104241532059. The next prime is 1104241532123. The reversal of 1104241532103 is 3012351424011.
1104241532103 is a `hidden beast` number, since 1 + 1 + 0 + 4 + 24 + 1 + 532 + 103 = 666.
It is not a de Polignac number, because 1104241532103 - 221 = 1104239434951 is a prime.
It is a super-2 number, since 2×11042415321032 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1104241532123) 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 11 ways as a sum of consecutive naturals, for example, 216770428 + ... + 216775521.
Almost surely, 21104241532103 is an apocalyptic number.
1104241532103 is a deficient number, since it is larger than the sum of its proper divisors (496410115297).
1104241532103 is a wasteful number, since it uses less digits than its factorization.
1104241532103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 433546238 (or 433546235 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
Adding to 1104241532103 its reverse (3012351424011), we get a palindrome (4116592956114).
The spelling of 1104241532103 in words is "one trillion, one hundred four billion, two hundred forty-one million, five hundred thirty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •