Base | Representation |
---|---|
bin | 11010000110101011011111… |
… | …10001000111001100100001 |
3 | 21112020210001100010112101112 |
4 | 31003111233301013030201 |
5 | 30011002110420302140 |
6 | 322031030244113105 |
7 | 15043211302121003 |
oct | 1503255761071441 |
9 | 245223040115345 |
10 | 57404113056545 |
11 | 17321a47331012 |
12 | 6531375395795 |
13 | 26052528439b8 |
14 | 1026533d86373 |
15 | 69832cdb0c65 |
hex | 34356fc47321 |
57404113056545 has 24 divisors (see below), whose sum is σ = 71399161411200. Its totient is φ = 44293137826496.
The previous prime is 57404113056467. The next prime is 57404113056551. The reversal of 57404113056545 is 54565031140475.
57404113056545 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 57404113056545 - 226 = 57404045947681 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 57404113056493 and 57404113056502.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 33808265 + ... + 35465574.
It is an arithmetic number, because the mean of its divisors is an integer number (2974965058800).
Almost surely, 257404113056545 is an apocalyptic number.
It is an amenable number.
57404113056545 is a deficient number, since it is larger than the sum of its proper divisors (13995048354655).
57404113056545 is an equidigital number, since it uses as much as digits as its factorization.
57404113056545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69274009 (or 69273956 counting only the distinct ones).
The product of its (nonzero) digits is 5040000, while the sum is 50.
The spelling of 57404113056545 in words is "fifty-seven trillion, four hundred four billion, one hundred thirteen million, fifty-six thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •