Base | Representation |
---|---|
bin | 1101101000110… |
… | …1001010000001 |
3 | 10222122010101222 |
4 | 3122031022001 |
5 | 104120420111 |
6 | 5402004425 |
7 | 1263126404 |
oct | 332151201 |
9 | 128563358 |
10 | 57201281 |
11 | 2a31a195 |
12 | 171a6715 |
13 | bb0a117 |
14 | 784dd3b |
15 | 504d7db |
hex | 368d281 |
57201281 has 4 divisors (see below), whose sum is σ = 57638064. Its totient is φ = 56764500.
The previous prime is 57201271. The next prime is 57201289. The reversal of 57201281 is 18210275.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 57201281 - 26 = 57201217 is a prime.
It is a super-2 number, since 2×572012812 = 6543973096081922, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 57201281.
It is not an unprimeable number, because it can be changed into a prime (57201289) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 218195 + ... + 218456.
It is an arithmetic number, because the mean of its divisors is an integer number (14409516).
Almost surely, 257201281 is an apocalyptic number.
It is an amenable number.
57201281 is a deficient number, since it is larger than the sum of its proper divisors (436783).
57201281 is a wasteful number, since it uses less digits than its factorization.
57201281 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 436782.
The product of its (nonzero) digits is 1120, while the sum is 26.
The square root of 57201281 is about 7563.1528478539. The cubic root of 57201281 is about 385.3025810444.
The spelling of 57201281 in words is "fifty-seven million, two hundred one thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •