Base | Representation |
---|---|
bin | 110101101101000000… |
… | …001001110111010101 |
3 | 12111211122201202120110 |
4 | 311231000021313111 |
5 | 1421043303104142 |
6 | 42253513153233 |
7 | 4110644142651 |
oct | 655500116725 |
9 | 174748652513 |
10 | 57663331797 |
11 | 225004a1715 |
12 | b2133bb819 |
13 | 558c616b96 |
14 | 2b103dba61 |
15 | 177753b99c |
hex | d6d009dd5 |
57663331797 has 4 divisors (see below), whose sum is σ = 76884442400. Its totient is φ = 38442221196.
The previous prime is 57663331793. The next prime is 57663331879. The reversal of 57663331797 is 79713336675.
57663331797 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 57663331797 - 22 = 57663331793 is a prime.
It is a super-2 number, since 2×576633317972 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (57663331793) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9610555297 + ... + 9610555302.
It is an arithmetic number, because the mean of its divisors is an integer number (19221110600).
Almost surely, 257663331797 is an apocalyptic number.
It is an amenable number.
57663331797 is a deficient number, since it is larger than the sum of its proper divisors (19221110603).
57663331797 is a wasteful number, since it uses less digits than its factorization.
57663331797 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19221110602.
The product of its digits is 15002820, while the sum is 57.
The spelling of 57663331797 in words is "fifty-seven billion, six hundred sixty-three million, three hundred thirty-one thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •