Base | Representation |
---|---|
bin | 110101111111011000… |
… | …101110001100111101 |
3 | 12112122011002122020121 |
4 | 311333120232030331 |
5 | 1422211232340411 |
6 | 42344252014541 |
7 | 4121410563220 |
oct | 657730561475 |
9 | 175564078217 |
10 | 57971761981 |
11 | 226496038a1 |
12 | b29a761451 |
13 | 560b4a6b53 |
14 | 2b3d3675b7 |
15 | 1794663571 |
hex | d7f62e33d |
57971761981 has 4 divisors (see below), whose sum is σ = 66253442272. Its totient is φ = 49690081692.
The previous prime is 57971761979. The next prime is 57971762003. The reversal of 57971761981 is 18916717975.
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 a cyclic number.
It is not a de Polignac number, because 57971761981 - 21 = 57971761979 is a prime.
It is a super-2 number, since 2×579717619812 (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 (57971761181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4140840135 + ... + 4140840148.
It is an arithmetic number, because the mean of its divisors is an integer number (16563360568).
Almost surely, 257971761981 is an apocalyptic number.
It is an amenable number.
57971761981 is a deficient number, since it is larger than the sum of its proper divisors (8281680291).
57971761981 is an equidigital number, since it uses as much as digits as its factorization.
57971761981 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8281680290.
The product of its digits is 6667920, while the sum is 61.
The spelling of 57971761981 in words is "fifty-seven billion, nine hundred seventy-one million, seven hundred sixty-one thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •