Base | Representation |
---|---|
bin | 11010000111010001010111… |
… | …01101100111110111001001 |
3 | 21112022201112101101120011211 |
4 | 31003220223231213313021 |
5 | 30011320231202040221 |
6 | 322044232032253121 |
7 | 15044531210303302 |
oct | 1503505355476711 |
9 | 245281471346154 |
10 | 57424446127561 |
11 | 1732a630872237 |
12 | 65352aa9a11a1 |
13 | 2607143228176 |
14 | 10275025ad7a9 |
15 | 698b1cebe6e1 |
hex | 343a2bb67dc9 |
57424446127561 has 4 divisors (see below), whose sum is σ = 57554072417232. Its totient is φ = 57294819837892.
The previous prime is 57424446127553. The next prime is 57424446127571. The reversal of 57424446127561 is 16572164442475.
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 57424446127561 - 23 = 57424446127553 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 57424446127496 and 57424446127505.
It is not an unprimeable number, because it can be changed into a prime (57424446127571) 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, 64813144171 + ... + 64813145056.
It is an arithmetic number, because the mean of its divisors is an integer number (14388518104308).
Almost surely, 257424446127561 is an apocalyptic number.
It is an amenable number.
57424446127561 is a deficient number, since it is larger than the sum of its proper divisors (129626289671).
57424446127561 is a wasteful number, since it uses less digits than its factorization.
57424446127561 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 129626289670.
The product of its digits is 45158400, while the sum is 58.
The spelling of 57424446127561 in words is "fifty-seven trillion, four hundred twenty-four billion, four hundred forty-six million, one hundred twenty-seven thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •