Base | Representation |
---|---|
bin | 111101110000111… |
… | …1111000100111001 |
3 | 12100102210020200201 |
4 | 1323201333010321 |
5 | 13221030203211 |
6 | 541353002201 |
7 | 102234005350 |
oct | 17341770471 |
9 | 5312706621 |
10 | 2072506681 |
11 | 97396aa43 |
12 | 49a0b3361 |
13 | 2704b2b1b |
14 | 159370997 |
15 | c1e360c1 |
hex | 7b87f139 |
2072506681 has 16 divisors (see below), whose sum is σ = 2495104000. Its totient is φ = 1681680528.
The previous prime is 2072506673. The next prime is 2072506687. The reversal of 2072506681 is 1866052702.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 2072506681 - 23 = 2072506673 is a prime.
It is a super-2 number, since 2×20725066812 = 8590567885579271522, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2072506681.
It is not an unprimeable number, because it can be changed into a prime (2072506687) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 200170 + ... + 210268.
It is an arithmetic number, because the mean of its divisors is an integer number (155944000).
Almost surely, 22072506681 is an apocalyptic number.
It is an amenable number.
2072506681 is a deficient number, since it is larger than the sum of its proper divisors (422597319).
2072506681 is a wasteful number, since it uses less digits than its factorization.
2072506681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11668.
The product of its (nonzero) digits is 40320, while the sum is 37.
The square root of 2072506681 is about 45524.7919380199. The cubic root of 2072506681 is about 1274.9661261794.
The spelling of 2072506681 in words is "two billion, seventy-two million, five hundred six thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •