Base | Representation |
---|---|
bin | 111110101011111… |
… | …1100101111011110 |
3 | 12102120222022122220 |
4 | 1331113330233132 |
5 | 13301434230420 |
6 | 544415450210 |
7 | 103060601205 |
oct | 17527745736 |
9 | 5376868586 |
10 | 2103430110 |
11 | 98a3711a1 |
12 | 4a8526966 |
13 | 276a1c202 |
14 | 15d50023c |
15 | c49e3840 |
hex | 7d5fcbde |
2103430110 has 16 divisors (see below), whose sum is σ = 5048232336. Its totient is φ = 560914688.
The previous prime is 2103430099. The next prime is 2103430123. The reversal of 2103430110 is 110343012.
It is a super-2 number, since 2×21034301102 = 8848836455309224200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 2103430110.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 35057139 + ... + 35057198.
It is an arithmetic number, because the mean of its divisors is an integer number (315514521).
Almost surely, 22103430110 is an apocalyptic number.
2103430110 is an abundant number, since it is smaller than the sum of its proper divisors (2944802226).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2103430110 is a wasteful number, since it uses less digits than its factorization.
2103430110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70114347.
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 2103430110 is about 45863.1672478035. The cubic root of 2103430110 is about 1281.2760122897.
Adding to 2103430110 its reverse (110343012), we get a palindrome (2213773122).
The spelling of 2103430110 in words is "two billion, one hundred three million, four hundred thirty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •