Base | Representation |
---|---|
bin | 1001011100011111110010110… |
… | …1110011111101101011110101 |
3 | 10020011100001001120200022100210 |
4 | 2113013330231303331223311 |
5 | 1144104121231132320041 |
6 | 10313332323100500033 |
7 | 256666316433320142 |
oct | 22707745563755365 |
9 | 3204301046608323 |
10 | 664651252620021 |
11 | 182862016755217 |
12 | 62665a4784a619 |
13 | 226b346223a024 |
14 | ba1b413dc53c9 |
15 | 51c91873c0016 |
hex | 25c7f2dcfdaf5 |
664651252620021 has 8 divisors (see below), whose sum is σ = 886944504758400. Its totient is φ = 442729417780832.
The previous prime is 664651252619989. The next prime is 664651252620049. The reversal of 664651252620021 is 120026252156466.
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 664651252620021 - 25 = 664651252619989 is a prime.
It is a super-2 number, since 2×6646512526200212 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (664651252625021) 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, 92854320621 + ... + 92854327778.
It is an arithmetic number, because the mean of its divisors is an integer number (110868063094800).
Almost surely, 2664651252620021 is an apocalyptic number.
It is an amenable number.
664651252620021 is a deficient number, since it is larger than the sum of its proper divisors (222293252138379).
664651252620021 is a wasteful number, since it uses less digits than its factorization.
664651252620021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 185708649595.
The product of its (nonzero) digits is 2073600, while the sum is 48.
The spelling of 664651252620021 in words is "six hundred sixty-four trillion, six hundred fifty-one billion, two hundred fifty-two million, six hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •