Base | Representation |
---|---|
bin | 1100100001000101… |
… | …11101001111011001 |
3 | 122100022221220202211 |
4 | 12100202331033121 |
5 | 102230313101022 |
6 | 3030453555121 |
7 | 325346324623 |
oct | 62042751731 |
9 | 18308856684 |
10 | 6720050137 |
11 | 2939325149 |
12 | 1376645aa1 |
13 | 831308338 |
14 | 47a6c5c13 |
15 | 294e6ae77 |
hex | 1908bd3d9 |
6720050137 has 4 divisors (see below), whose sum is σ = 6737781520. Its totient is φ = 6702318756.
The previous prime is 6720050123. The next prime is 6720050153. The reversal of 6720050137 is 7310500276.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 6720050137 - 231 = 4572566489 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 6720050099 and 6720050108.
It is not an unprimeable number, because it can be changed into a prime (6720050437) 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 3 ways as a sum of consecutive naturals, for example, 8865123 + ... + 8865880.
It is an arithmetic number, because the mean of its divisors is an integer number (1684445380).
Almost surely, 26720050137 is an apocalyptic number.
It is an amenable number.
6720050137 is a deficient number, since it is larger than the sum of its proper divisors (17731383).
6720050137 is a wasteful number, since it uses less digits than its factorization.
6720050137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17731382.
The product of its (nonzero) digits is 8820, while the sum is 31.
The square root of 6720050137 is about 81975.9119314936. The cubic root of 6720050137 is about 1887.0822851908.
The spelling of 6720050137 in words is "six billion, seven hundred twenty million, fifty thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •