Base | Representation |
---|---|
bin | 110101001011110001… |
… | …000111001010011001 |
3 | 12110101210112012000202 |
4 | 311023301013022121 |
5 | 1413423032143231 |
6 | 42122314111545 |
7 | 4061063533121 |
oct | 651361071231 |
9 | 173353465022 |
10 | 57105740441 |
11 | 2224477a012 |
12 | b09871b5b5 |
13 | 5500c49279 |
14 | 2a9a333c81 |
15 | 17435e95cb |
hex | d4bc47299 |
57105740441 has 8 divisors (see below), whose sum is σ = 57946972800. Its totient is φ = 56266101792.
The previous prime is 57105740423. The next prime is 57105740443. The reversal of 57105740441 is 14404750175.
57105740441 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 57105740441 - 210 = 57105739417 is a prime.
It is a super-2 number, since 2×571057404412 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 57105740395 and 57105740404.
It is not an unprimeable number, because it can be changed into a prime (57105740443) 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, 326141 + ... + 469658.
It is an arithmetic number, because the mean of its divisors is an integer number (7243371600).
Almost surely, 257105740441 is an apocalyptic number.
It is an amenable number.
57105740441 is a deficient number, since it is larger than the sum of its proper divisors (841232359).
57105740441 is an equidigital number, since it uses as much as digits as its factorization.
57105740441 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 796855.
The product of its (nonzero) digits is 78400, while the sum is 38.
The spelling of 57105740441 in words is "fifty-seven billion, one hundred five million, seven hundred forty thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •