Base | Representation |
---|---|
bin | 1101001111100101… |
… | …00000000000000001 |
3 | 200100111201110022002 |
4 | 12213302200000001 |
5 | 104030130010031 |
6 | 3133303553345 |
7 | 341123002562 |
oct | 64762400001 |
9 | 20314643262 |
10 | 7110000641 |
11 | 3019456797 |
12 | 146515b855 |
13 | 89403b693 |
14 | 4b63d2169 |
15 | 2b92e6ccb |
hex | 1a7ca0001 |
7110000641 has 8 divisors (see below), whose sum is σ = 7139907840. Its totient is φ = 7080139872.
The previous prime is 7110000613. The next prime is 7110000683. The reversal of 7110000641 is 1460000117.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 7110000641 - 230 = 6036258817 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (7110000041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 314276 + ... + 336138.
It is an arithmetic number, because the mean of its divisors is an integer number (892488480).
It is a Proth number, since it is equal to 54245 ⋅ 217 + 1 and 54245 < 217.
Almost surely, 27110000641 is an apocalyptic number.
It is an amenable number.
7110000641 is a deficient number, since it is larger than the sum of its proper divisors (29907199).
7110000641 is a wasteful number, since it uses less digits than its factorization.
7110000641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23215.
The product of its (nonzero) digits is 168, while the sum is 20.
The square root of 7110000641 is about 84320.8197362905. The cubic root of 7110000641 is about 1922.8993234256.
Adding to 7110000641 its reverse (1460000117), we get a palindrome (8570000758).
The spelling of 7110000641 in words is "seven billion, one hundred ten million, six hundred forty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •