Base | Representation |
---|---|
bin | 10000000011100110010… |
… | …110010110101011011001 |
3 | 10220111000012001220121221 |
4 | 100003212112112223121 |
5 | 121034203304410023 |
6 | 2202514542132041 |
7 | 142500456233521 |
oct | 20034626265331 |
9 | 3814005056557 |
10 | 1103376247513 |
11 | 395a371437a1 |
12 | 159a12581021 |
13 | 80081405977 |
14 | 3b591a50681 |
15 | 1da7c0b585d |
hex | 100e6596ad9 |
1103376247513 has 12 divisors (see below), whose sum is σ = 1131043618204. Its totient is φ = 1076370048000.
The previous prime is 1103376247489. The next prime is 1103376247543. The reversal of 1103376247513 is 3157426733011.
It can be written as a sum of positive squares in 6 ways, for example, as 349905374784 + 753470872729 = 591528^2 + 868027^2 .
It is not a de Polignac number, because 1103376247513 - 217 = 1103376116441 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1103376247513.
It is not an unprimeable number, because it can be changed into a prime (1103376247543) 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, 26204245 + ... + 26246317.
Almost surely, 21103376247513 is an apocalyptic number.
It is an amenable number.
1103376247513 is a deficient number, since it is larger than the sum of its proper divisors (27667370691).
1103376247513 is an equidigital number, since it uses as much as digits as its factorization.
1103376247513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57756 (or 57715 counting only the distinct ones).
The product of its (nonzero) digits is 317520, while the sum is 43.
The spelling of 1103376247513 in words is "one trillion, one hundred three billion, three hundred seventy-six million, two hundred forty-seven thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •