Base | Representation |
---|---|
bin | 111110101100100… |
… | …0000010100011100 |
3 | 12102121111101100200 |
4 | 1331121000110130 |
5 | 13302022110113 |
6 | 544425423500 |
7 | 103063133202 |
oct | 17531002434 |
9 | 5377441320 |
10 | 2103706908 |
11 | 98a540156 |
12 | 4a863ab90 |
13 | 276ab81b4 |
14 | 15d573072 |
15 | c4a4a873 |
hex | 7d64051c |
2103706908 has 18 divisors (see below), whose sum is σ = 5317703664. Its totient is φ = 701235624.
The previous prime is 2103706907. The next prime is 2103706909. The reversal of 2103706908 is 8096073012.
It is an interprime number because it is at equal distance from previous prime (2103706907) and next prime (2103706909).
It is a tau number, because it is divible by the number of its divisors (18).
It is a Harshad number since it is a multiple of its sum of digits (36), and also a Moran number because the ratio is a prime number: 58436303 = 2103706908 / (2 + 1 + 0 + 3 + 7 + 0 + 6 + 9 + 0 + 8).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2103706901) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 29218116 + ... + 29218187.
Almost surely, 22103706908 is an apocalyptic number.
It is an amenable number.
2103706908 is an abundant number, since it is smaller than the sum of its proper divisors (3213996756).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2103706908 is a wasteful number, since it uses less digits than its factorization.
2103706908 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 58436313 (or 58436308 counting only the distinct ones).
The product of its (nonzero) digits is 18144, while the sum is 36.
The square root of 2103706908 is about 45866.1847988254. The cubic root of 2103706908 is about 1281.3322124110.
The spelling of 2103706908 in words is "two billion, one hundred three million, seven hundred six thousand, nine hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •