Base | Representation |
---|---|
bin | 100000111001001… |
… | …0110111010010101 |
3 | 2211220211210022200 |
4 | 1001302112322111 |
5 | 4230023020320 |
6 | 301304315113 |
7 | 36231315546 |
oct | 10162267225 |
9 | 2756753280 |
10 | 1103720085 |
11 | 517026266 |
12 | 269772a99 |
13 | 147884010 |
14 | a682a4cd |
15 | 66d6d290 |
hex | 41c96e95 |
1103720085 has 24 divisors (see below), whose sum is σ = 2060278584. Its totient is φ = 543369600.
The previous prime is 1103720083. The next prime is 1103720117. The reversal of 1103720085 is 5800273011.
It can be written as a sum of positive squares in 4 ways, for example, as 206238321 + 897481764 = 14361^2 + 29958^2 .
It is not a de Polignac number, because 1103720085 - 21 = 1103720083 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1103720083) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 942766 + ... + 943935.
It is an arithmetic number, because the mean of its divisors is an integer number (85844941).
Almost surely, 21103720085 is an apocalyptic number.
1103720085 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1103720085 is a deficient number, since it is larger than the sum of its proper divisors (956558499).
1103720085 is a wasteful number, since it uses less digits than its factorization.
1103720085 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1886725 (or 1886722 counting only the distinct ones).
The product of its (nonzero) digits is 1680, while the sum is 27.
The square root of 1103720085 is about 33222.2829588817. The cubic root of 1103720085 is about 1033.4424939021.
Adding to 1103720085 its reverse (5800273011), we get a palindrome (6903993096).
The spelling of 1103720085 in words is "one billion, one hundred three million, seven hundred twenty thousand, eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •