Base | Representation |
---|---|
bin | 11010000111110010010111… |
… | …11000001101000111111001 |
3 | 21112101102021021210010222001 |
4 | 31003321023320031013321 |
5 | 30012113023401013341 |
6 | 322100322215101001 |
7 | 15046026261552400 |
oct | 1503711370150771 |
9 | 245342237703861 |
10 | 57442165641721 |
11 | 173370a3a99513 |
12 | 6538815071761 |
13 | 2608a08300ba3 |
14 | 1028303a66637 |
15 | 699308920d31 |
hex | 343e4be0d1f9 |
57442165641721 has 9 divisors (see below), whose sum is σ = 66820540114821. Its totient is φ = 49236096504252.
The previous prime is 57442165641719. The next prime is 57442165641781. The reversal of 57442165641721 is 12714656124475.
The square root of 57442165641721 is 7579061.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 57442165641721 - 21 = 57442165641719 is a prime.
It is a super-2 number, since 2×574421656417212 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (57442165641781) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 52512066 + ... + 53594788.
Almost surely, 257442165641721 is an apocalyptic number.
57442165641721 is the 7579061-st square number.
57442165641721 is the 3789531-st centered octagonal number.
It is an amenable number.
57442165641721 is a deficient number, since it is larger than the sum of its proper divisors (9378374473100).
57442165641721 is an frugal number, since it uses more digits than its factorization.
57442165641721 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2165460 (or 1082730 counting only the distinct ones).
The product of its digits is 11289600, while the sum is 55.
The spelling of 57442165641721 in words is "fifty-seven trillion, four hundred forty-two billion, one hundred sixty-five million, six hundred forty-one thousand, seven hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •