Base | Representation |
---|---|
bin | 11001111011001010000101… |
… | …11000100100000000111001 |
3 | 21110211221012002020010210000 |
4 | 30331211002320210000321 |
5 | 24433010320044344031 |
6 | 321125114403143213 |
7 | 15002464624412442 |
oct | 1475450270440071 |
9 | 243757162203700 |
10 | 57008223043641 |
11 | 1718a062785871 |
12 | 64886aa674b09 |
13 | 25a6b108565ac |
14 | 10112d99a82c9 |
15 | 68cdac2163e6 |
hex | 33d942e24039 |
57008223043641 has 15 divisors (see below), whose sum is σ = 85160533464853. Its totient is φ = 38005436726820.
The previous prime is 57008223043627. The next prime is 57008223043663. The reversal of 57008223043641 is 14634032280075.
The square root of 57008223043641 is 7550379.
It is a perfect power (a square), and thus also a powerful number.
57008223043641 is a `hidden beast` number, since 5 + 70 + 0 + 82 + 2 + 30 + 436 + 41 = 666.
It is not a de Polignac number, because 57008223043641 - 25 = 57008223043609 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (57008223023641) by changing a digit.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 67533946 + ... + 68372876.
Almost surely, 257008223043641 is an apocalyptic number.
57008223043641 is the 7550379-th square number.
57008223043641 is the 3775190-th centered octagonal number.
It is an amenable number.
57008223043641 is a deficient number, since it is larger than the sum of its proper divisors (28152310421212).
57008223043641 is an frugal number, since it uses more digits than its factorization.
57008223043641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1677874 (or 838934 counting only the distinct ones).
The product of its (nonzero) digits is 967680, while the sum is 45.
The spelling of 57008223043641 in words is "fifty-seven trillion, eight billion, two hundred twenty-three million, forty-three thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •