Base | Representation |
---|---|
bin | 1101001111010011… |
… | …00101100010001101 |
3 | 200100100022202001022 |
4 | 12213221211202031 |
5 | 104024030222023 |
6 | 3133141523525 |
7 | 341064101342 |
oct | 64751454215 |
9 | 20310282038 |
10 | 7107664013 |
11 | 301810019a |
12 | 14644135a5 |
13 | 893700c68 |
14 | 4b5d847c9 |
15 | 2b8ed47c8 |
hex | 1a7a6588d |
7107664013 has 8 divisors (see below), whose sum is σ = 7142515200. Its totient is φ = 7072897168.
The previous prime is 7107663989. The next prime is 7107664037. The reversal of 7107664013 is 3104667017.
It is an interprime number because it is at equal distance from previous prime (7107663989) and next prime (7107664037).
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 7107664013 - 26 = 7107663949 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 (7107664313) 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 7 ways as a sum of consecutive naturals, for example, 151295 + ... + 192627.
It is an arithmetic number, because the mean of its divisors is an integer number (892814400).
Almost surely, 27107664013 is an apocalyptic number.
It is an amenable number.
7107664013 is a deficient number, since it is larger than the sum of its proper divisors (34851187).
7107664013 is a wasteful number, since it uses less digits than its factorization.
7107664013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42171.
The product of its (nonzero) digits is 21168, while the sum is 35.
The square root of 7107664013 is about 84306.9630161115. The cubic root of 7107664013 is about 1922.6886533699.
The spelling of 7107664013 in words is "seven billion, one hundred seven million, six hundred sixty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •