Base | Representation |
---|---|
bin | 100001000010011… |
… | …0011101000111001 |
3 | 2212020221111102102 |
4 | 1002010303220321 |
5 | 4232242300340 |
6 | 302000113145 |
7 | 36320400461 |
oct | 10204635071 |
9 | 2766844372 |
10 | 1108556345 |
11 | 519829876 |
12 | 26b3057b5 |
13 | 148888400 |
14 | a7328ba1 |
15 | 674c6215 |
hex | 42133a39 |
1108556345 has 12 divisors (see below), whose sum is σ = 1440468396. Its totient is φ = 818625600.
The previous prime is 1108556341. The next prime is 1108556359. The reversal of 1108556345 is 5436558011.
It can be written as a sum of positive squares in 6 ways, for example, as 275194921 + 833361424 = 16589^2 + 28868^2 .
It is not a de Polignac number, because 1108556345 - 22 = 1108556341 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1108556299 and 1108556308.
It is not an unprimeable number, because it can be changed into a prime (1108556341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 655106 + ... + 656795.
It is an arithmetic number, because the mean of its divisors is an integer number (120039033).
Almost surely, 21108556345 is an apocalyptic number.
It is an amenable number.
1108556345 is a deficient number, since it is larger than the sum of its proper divisors (331912051).
1108556345 is a wasteful number, since it uses less digits than its factorization.
1108556345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1311932 (or 1311919 counting only the distinct ones).
The product of its (nonzero) digits is 72000, while the sum is 38.
The square root of 1108556345 is about 33294.9897882549. The cubic root of 1108556345 is about 1034.9497342310.
The spelling of 1108556345 in words is "one billion, one hundred eight million, five hundred fifty-six thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •