Base | Representation |
---|---|
bin | 111110011101110… |
… | …1010100011010000 |
3 | 12102002000121211020 |
4 | 1330323222203100 |
5 | 13243034444233 |
6 | 543552515440 |
7 | 102640560363 |
oct | 17473524320 |
9 | 5362017736 |
10 | 2096015568 |
11 | 986167579 |
12 | 4a5b4bb80 |
13 | 2753243ca |
14 | 15c5300da |
15 | c402b9b3 |
hex | 7ceea8d0 |
2096015568 has 40 divisors (see below), whose sum is σ = 5425620000. Its totient is φ = 697263744.
The previous prime is 2096015567. The next prime is 2096015569. The reversal of 2096015568 is 8655106902.
It is an interprime number because it is at equal distance from previous prime (2096015567) and next prime (2096015569).
It is a super-2 number, since 2×20960155682 = 8786562522596725248, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2096015563) 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 7 ways as a sum of consecutive naturals, for example, 19803 + ... + 67706.
It is an arithmetic number, because the mean of its divisors is an integer number (135640500).
Almost surely, 22096015568 is an apocalyptic number.
It is an amenable number.
2096015568 is an abundant number, since it is smaller than the sum of its proper divisors (3329604432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2096015568 is a wasteful number, since it uses less digits than its factorization.
2096015568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88019 (or 88013 counting only the distinct ones).
The product of its (nonzero) digits is 129600, while the sum is 42.
The square root of 2096015568 is about 45782.2625915321. The cubic root of 2096015568 is about 1279.7687505419.
The spelling of 2096015568 in words is "two billion, ninety-six million, fifteen thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •