Base | Representation |
---|---|
bin | 1011001011110110… |
… | …10111000100001001 |
3 | 120111111111222112102 |
4 | 11211323113010021 |
5 | 44244241331311 |
6 | 2431512323145 |
7 | 301544613404 |
oct | 54573270411 |
9 | 16444458472 |
10 | 6005027081 |
11 | 26017547a9 |
12 | 11b70a34b5 |
13 | 749138c81 |
14 | 40d75ad3b |
15 | 2522cc43b |
hex | 165ed7109 |
6005027081 has 4 divisors (see below), whose sum is σ = 6198737664. Its totient is φ = 5811316500.
The previous prime is 6005027027. The next prime is 6005027101. The reversal of 6005027081 is 1807205006.
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 a de Polignac number, because none of the positive numbers 2k-6005027081 is a prime.
It is a super-2 number, since 2×60050270812 = 72120700487086761122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6005027681) 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, 96855245 + ... + 96855306.
It is an arithmetic number, because the mean of its divisors is an integer number (1549684416).
Almost surely, 26005027081 is an apocalyptic number.
It is an amenable number.
6005027081 is a deficient number, since it is larger than the sum of its proper divisors (193710583).
6005027081 is a wasteful number, since it uses less digits than its factorization.
6005027081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 193710582.
The product of its (nonzero) digits is 3360, while the sum is 29.
The square root of 6005027081 is about 77492.1097983530. The cubic root of 6005027081 is about 1817.6279407434.
The spelling of 6005027081 in words is "six billion, five million, twenty-seven thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •