Base | Representation |
---|---|
bin | 11010010101110100100101… |
… | …11100110111011001011101 |
3 | 21121002111222122020101010221 |
4 | 31022322102330313121131 |
5 | 30043013124430223231 |
6 | 323110033250401341 |
7 | 15125620330331002 |
oct | 1512722274673135 |
9 | 247074878211127 |
10 | 57924394382941 |
11 | 175026635a8189 |
12 | 65b6176590251 |
13 | 2642329729708 |
14 | 10437ac9a38a9 |
15 | 6a6b2e2d0d11 |
hex | 34ae92f3765d |
57924394382941 has 8 divisors (see below), whose sum is σ = 59382934108344. Its totient is φ = 56468033210880.
The previous prime is 57924394382929. The next prime is 57924394382957. The reversal of 57924394382941 is 14928349342975.
It can be written as a sum of positive squares in 4 ways, for example, as 9330306248025 + 48594088134916 = 3054555^2 + 6970946^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-57924394382941 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (57924394382441) 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, 544584490 + ... + 544690843.
It is an arithmetic number, because the mean of its divisors is an integer number (7422866763543).
Almost surely, 257924394382941 is an apocalyptic number.
It is an amenable number.
57924394382941 is a deficient number, since it is larger than the sum of its proper divisors (1458539725403).
57924394382941 is a wasteful number, since it uses less digits than its factorization.
57924394382941 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1089276671.
The product of its digits is 470292480, while the sum is 70.
The spelling of 57924394382941 in words is "fifty-seven trillion, nine hundred twenty-four billion, three hundred ninety-four million, three hundred eighty-two thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.179 sec. • engine limits •