Base | Representation |
---|---|
bin | 111110110001101… |
… | …0111001100101001 |
3 | 12102210121022211202 |
4 | 1331203113030221 |
5 | 13303221001212 |
6 | 545003533545 |
7 | 103125202115 |
oct | 17543271451 |
9 | 5383538752 |
10 | 2106422057 |
11 | 991025083 |
12 | 4a952a2b5 |
13 | 277528cac |
14 | 15da7c745 |
15 | c4dd50c2 |
hex | 7d8d7329 |
2106422057 has 16 divisors (see below), whose sum is σ = 2166521280. Its totient is φ = 2047436352.
The previous prime is 2106422051. The next prime is 2106422063. The reversal of 2106422057 is 7502246012.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (2106422051) and next prime (2106422063).
It is a cyclic number.
It is not a de Polignac number, because 2106422057 - 210 = 2106421033 is a prime.
It is a super-2 number, since 2×21064220572 = 8874027764432222498, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2106422051) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1419638 + ... + 1421120.
It is an arithmetic number, because the mean of its divisors is an integer number (135407580).
Almost surely, 22106422057 is an apocalyptic number.
It is an amenable number.
2106422057 is a deficient number, since it is larger than the sum of its proper divisors (60099223).
2106422057 is a wasteful number, since it uses less digits than its factorization.
2106422057 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1832.
The product of its (nonzero) digits is 6720, while the sum is 29.
The square root of 2106422057 is about 45895.7738468369. The cubic root of 2106422057 is about 1281.8832258320.
Adding to 2106422057 its reverse (7502246012), we get a palindrome (9608668069).
The spelling of 2106422057 in words is "two billion, one hundred six million, four hundred twenty-two thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •