Base | Representation |
---|---|
bin | 1101101010010… |
… | …1101010001001 |
3 | 10222211020002000 |
4 | 3122211222021 |
5 | 104132123031 |
6 | 5404101213 |
7 | 1264025115 |
oct | 332455211 |
9 | 128736060 |
10 | 57301641 |
11 | 2a388631 |
12 | 17234809 |
13 | bb439c7 |
14 | 7878745 |
15 | 506d3e6 |
hex | 36a5a89 |
57301641 has 32 divisors (see below), whose sum is σ = 89376000. Its totient is φ = 36236160.
The previous prime is 57301633. The next prime is 57301661. The reversal of 57301641 is 14610375.
57301641 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 57301641 - 23 = 57301633 is a prime.
It is a super-2 number, since 2×573016412 = 6566956122585762, 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 not an unprimeable number, because it can be changed into a prime (57301661) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 40260 + ... + 41658.
It is an arithmetic number, because the mean of its divisors is an integer number (2793000).
Almost surely, 257301641 is an apocalyptic number.
It is an amenable number.
57301641 is a deficient number, since it is larger than the sum of its proper divisors (32074359).
57301641 is a wasteful number, since it uses less digits than its factorization.
57301641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1486 (or 1480 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 27.
The square root of 57301641 is about 7569.7847393436. The cubic root of 57301641 is about 385.5277879710.
The spelling of 57301641 in words is "fifty-seven million, three hundred one thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •