Base | Representation |
---|---|
bin | 1101001001101111… |
… | …10100110101100101 |
3 | 200020002122021022012 |
4 | 12210313310311211 |
5 | 103430113040221 |
6 | 3124355044005 |
7 | 336660030341 |
oct | 64467646545 |
9 | 20202567265 |
10 | 7061065061 |
11 | 2aa3872766 |
12 | 14508a0605 |
13 | 886b6690b |
14 | 4adad4621 |
15 | 2b4d7c65b |
hex | 1a4df4d65 |
7061065061 has 4 divisors (see below), whose sum is σ = 7096548000. Its totient is φ = 7025582124.
The previous prime is 7061065027. The next prime is 7061065097. The reversal of 7061065061 is 1605601607.
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 7061065061 - 210 = 7061064037 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (7061365061) 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 3 ways as a sum of consecutive naturals, for example, 17741171 + ... + 17741568.
It is an arithmetic number, because the mean of its divisors is an integer number (1774137000).
Almost surely, 27061065061 is an apocalyptic number.
It is an amenable number.
7061065061 is a deficient number, since it is larger than the sum of its proper divisors (35482939).
7061065061 is a wasteful number, since it uses less digits than its factorization.
7061065061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35482938.
The product of its (nonzero) digits is 7560, while the sum is 32.
The square root of 7061065061 is about 84030.1437640089. The cubic root of 7061065061 is about 1918.4776217944.
Adding to 7061065061 its reverse (1605601607), we get a palindrome (8666666668).
The spelling of 7061065061 in words is "seven billion, sixty-one million, sixty-five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •