Base | Representation |
---|---|
bin | 1001100001100010000111001… |
… | …0110111011111001110111001 |
3 | 10020212221101222111212210010002 |
4 | 2120120201302313133032321 |
5 | 1200320332300222010223 |
6 | 10333212223055202345 |
7 | 261110346603510053 |
oct | 23030416267371671 |
9 | 3225841874783102 |
10 | 670188624016313 |
11 | 1845a7443526356 |
12 | 631bb0662163b5 |
13 | 229c5692a550ac |
14 | bb6d433dd28d3 |
15 | 527322657ae28 |
hex | 2618872ddf3b9 |
670188624016313 has 8 divisors (see below), whose sum is σ = 684454287928320. Its totient is φ = 655923223916320.
The previous prime is 670188624016243. The next prime is 670188624016321. The reversal of 670188624016313 is 313610426881076.
It is a happy number.
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 670188624016313 - 226 = 670188556907449 is a prime.
It is a super-2 number, since 2×6701886240163132 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (670188624016343) 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, 60813908 + ... + 70983861.
It is an arithmetic number, because the mean of its divisors is an integer number (85556785991040).
Almost surely, 2670188624016313 is an apocalyptic number.
It is an amenable number.
670188624016313 is a deficient number, since it is larger than the sum of its proper divisors (14265663912007).
670188624016313 is a wasteful number, since it uses less digits than its factorization.
670188624016313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131906007.
The product of its (nonzero) digits is 6967296, while the sum is 56.
The spelling of 670188624016313 in words is "six hundred seventy trillion, one hundred eighty-eight billion, six hundred twenty-four million, sixteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •