Base | Representation |
---|---|
bin | 1001011100110010101100100… |
… | …0110101101100110010100110 |
3 | 10020012111002020010011210010110 |
4 | 2113030223020311230302212 |
5 | 1144124431244334401130 |
6 | 10314141425055433450 |
7 | 260031633410300310 |
oct | 22714531065546246 |
9 | 3205432203153113 |
10 | 664975976090790 |
11 | 182977800684a91 |
12 | 626b8970b25886 |
13 | 22707c72201480 |
14 | ba2d01a88a7b0 |
15 | 51d284032bab0 |
hex | 25ccac8d6cca6 |
664975976090790 has 128 divisors (see below), whose sum is σ = 1964724528614400. Its totient is φ = 140267780725248.
The previous prime is 664975976090759. The next prime is 664975976090791. The reversal of 664975976090790 is 97090679579466.
664975976090790 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-5 number, since 5×6649759760907905 (a number of 75 digits) contains 55555 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (664975976090791) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 19249765 + ... + 41237184.
It is an arithmetic number, because the mean of its divisors is an integer number (15349410379800).
Almost surely, 2664975976090790 is an apocalyptic number.
664975976090790 is an abundant number, since it is smaller than the sum of its proper divisors (1299748552523610).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
664975976090790 is a wasteful number, since it uses less digits than its factorization.
664975976090790 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60491006.
The product of its (nonzero) digits is 9721827360, while the sum is 84.
The spelling of 664975976090790 in words is "six hundred sixty-four trillion, nine hundred seventy-five billion, nine hundred seventy-six million, ninety thousand, seven hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •