Base | Representation |
---|---|
bin | 100110101010110… |
… | …111000010110001 |
3 | 1200012202220201220 |
4 | 212222313002301 |
5 | 2312041112323 |
6 | 144213215253 |
7 | 22035310614 |
oct | 4652670261 |
9 | 1605686656 |
10 | 648769713 |
11 | 303239319 |
12 | 161331529 |
13 | a4543007 |
14 | 6224017b |
15 | 3be530e3 |
hex | 26ab70b1 |
648769713 has 8 divisors (see below), whose sum is σ = 865611648. Its totient is φ = 432220464.
The previous prime is 648769699. The next prime is 648769727. The reversal of 648769713 is 317967846.
648769713 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (648769699) and next prime (648769727).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-648769713 is a prime.
It is a super-2 number, since 2×6487697132 = 841804281012204738, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (648769753) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 67945 + ... + 76902.
It is an arithmetic number, because the mean of its divisors is an integer number (108201456).
Almost surely, 2648769713 is an apocalyptic number.
It is an amenable number.
648769713 is a deficient number, since it is larger than the sum of its proper divisors (216841935).
648769713 is a wasteful number, since it uses less digits than its factorization.
648769713 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146343.
The product of its digits is 1524096, while the sum is 51.
The square root of 648769713 is about 25470.9582269690. The cubic root of 648769713 is about 865.6922356998.
The spelling of 648769713 in words is "six hundred forty-eight million, seven hundred sixty-nine thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •