Base | Representation |
---|---|
bin | 111110110001101… |
… | …0100110001001110 |
3 | 12102210120211012100 |
4 | 1331203110301032 |
5 | 13303220141420 |
6 | 545003415530 |
7 | 103125131115 |
oct | 17543246116 |
9 | 5383524170 |
10 | 2106412110 |
11 | 991018660 |
12 | 4a95245a6 |
13 | 2775245ca |
14 | 15da78c7c |
15 | c4dd2190 |
hex | 7d8d4c4e |
2106412110 has 48 divisors (see below), whose sum is σ = 5974553520. Its totient is φ = 510645120.
The previous prime is 2106412093. The next prime is 2106412111. The reversal of 2106412110 is 112146012.
2106412110 is a `hidden beast` number, since 2 + 1 + 0 + 641 + 21 + 1 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2106412111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1062855 + ... + 1064834.
It is an arithmetic number, because the mean of its divisors is an integer number (124469865).
Almost surely, 22106412110 is an apocalyptic number.
2106412110 is an abundant number, since it is smaller than the sum of its proper divisors (3868141410).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2106412110 is a wasteful number, since it uses less digits than its factorization.
2106412110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2127713 (or 2127710 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
The square root of 2106412110 is about 45895.6654816117. The cubic root of 2106412110 is about 1281.8812080482.
Adding to 2106412110 its reverse (112146012), we get a palindrome (2218558122).
The spelling of 2106412110 in words is "two billion, one hundred six million, four hundred twelve thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •