Base | Representation |
---|---|
bin | 1101101011111… |
… | …0111110001001 |
3 | 11000000111022000 |
4 | 3122332332021 |
5 | 104143432241 |
6 | 5410221213 |
7 | 1264636311 |
oct | 332767611 |
9 | 130014260 |
10 | 57405321 |
11 | 2a449516 |
12 | 17284809 |
13 | bb7bc5c |
14 | 78a4441 |
15 | 508deb6 |
hex | 36bef89 |
57405321 has 16 divisors (see below), whose sum is σ = 85259520. Its totient is φ = 38173680.
The previous prime is 57405253. The next prime is 57405347. The reversal of 57405321 is 12350475.
It is a happy number.
It is not a de Polignac number, because 57405321 - 214 = 57388937 is a prime.
It is a super-2 number, since 2×574053212 = 6590741758226082, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (57405391) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9171 + ... + 14103.
It is an arithmetic number, because the mean of its divisors is an integer number (5328720).
Almost surely, 257405321 is an apocalyptic number.
It is an amenable number.
57405321 is a deficient number, since it is larger than the sum of its proper divisors (27854199).
57405321 is a wasteful number, since it uses less digits than its factorization.
57405321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5373 (or 5367 counting only the distinct ones).
The product of its (nonzero) digits is 4200, while the sum is 27.
The square root of 57405321 is about 7576.6299236534. The cubic root of 57405321 is about 385.7601689685.
Adding to 57405321 its reverse (12350475), we get a palindrome (69755796).
The spelling of 57405321 in words is "fifty-seven million, four hundred five thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •