Base | Representation |
---|---|
bin | 1100000111000010… |
… | …01000111110100001 |
3 | 121210002122220100101 |
4 | 12003201020332201 |
5 | 101303334020423 |
6 | 2553045022401 |
7 | 320053404235 |
oct | 60341107641 |
9 | 17702586311 |
10 | 6501470113 |
11 | 2836a017a6 |
12 | 13153b4a01 |
13 | 7c7c47048 |
14 | 4596685c5 |
15 | 280b917ad |
hex | 183848fa1 |
6501470113 has 2 divisors, whose sum is σ = 6501470114. Its totient is φ = 6501470112.
The previous prime is 6501470111. The next prime is 6501470117. The reversal of 6501470113 is 3110741056.
6501470113 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6268205584 + 233264529 = 79172^2 + 15273^2 .
It is a cyclic number.
It is not a de Polignac number, because 6501470113 - 21 = 6501470111 is a prime.
It is a super-2 number, since 2×65014701132 = 84538227260464465538, which contains 22 as substring.
Together with 6501470111, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (6501470111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3250735056 + 3250735057.
It is an arithmetic number, because the mean of its divisors is an integer number (3250735057).
Almost surely, 26501470113 is an apocalyptic number.
It is an amenable number.
6501470113 is a deficient number, since it is larger than the sum of its proper divisors (1).
6501470113 is an equidigital number, since it uses as much as digits as its factorization.
6501470113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2520, while the sum is 28.
The square root of 6501470113 is about 80631.6942213172. The cubic root of 6501470113 is about 1866.3962655764.
The spelling of 6501470113 in words is "six billion, five hundred one million, four hundred seventy thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •