Base | Representation |
---|---|
bin | 100000111000001… |
… | …0110110001101101 |
3 | 2211212212010101011 |
4 | 1001300112301231 |
5 | 4224404221440 |
6 | 301245145221 |
7 | 36224001445 |
oct | 10160266155 |
9 | 2755763334 |
10 | 1103195245 |
11 | 5167a7a09 |
12 | 26955b211 |
13 | 14772c169 |
14 | a6731125 |
15 | 66cb79ea |
hex | 41c16c6d |
1103195245 has 12 divisors (see below), whose sum is σ = 1328678100. Its totient is φ = 879334400.
The previous prime is 1103195243. The next prime is 1103195251. The reversal of 1103195245 is 5425913011.
It can be written as a sum of positive squares in 6 ways, for example, as 159845449 + 943349796 = 12643^2 + 30714^2 .
It is not a de Polignac number, because 1103195245 - 21 = 1103195243 is a prime.
It is a super-2 number, since 2×11031952452 = 2434079497181220050, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1103195243) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1573395 + ... + 1574095.
It is an arithmetic number, because the mean of its divisors is an integer number (110723175).
Almost surely, 21103195245 is an apocalyptic number.
It is an amenable number.
1103195245 is a deficient number, since it is larger than the sum of its proper divisors (225482855).
1103195245 is an frugal number, since it uses more digits than its factorization.
1103195245 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1856 (or 1155 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 31.
The square root of 1103195245 is about 33214.3831043119. The cubic root of 1103195245 is about 1033.2786607101.
It can be divided in two parts, 11031 and 95245, that added together give a square (106276 = 3262).
The spelling of 1103195245 in words is "one billion, one hundred three million, one hundred ninety-five thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •