Base | Representation |
---|---|
bin | 1101101001110… |
… | …1000001100011 |
3 | 10222202102120011 |
4 | 3122131001203 |
5 | 104130010100 |
6 | 5403225351 |
7 | 1263520033 |
oct | 332350143 |
9 | 128672504 |
10 | 57266275 |
11 | 2a364000 |
12 | 17218257 |
13 | bb30891 |
14 | 78698c3 |
15 | 5062bba |
hex | 369d063 |
57266275 has 24 divisors (see below), whose sum is σ = 78151248. Its totient is φ = 41624000.
The previous prime is 57266273. The next prime is 57266291.
57266275 is nontrivially palindromic in base 10.
57266275 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 57266275 - 21 = 57266273 is a prime.
It is a Duffinian number.
Its product of digits (176400) is a multiple of the sum of its prime factors (1764).
It is not an unprimeable number, because it can be changed into a prime (57266273) 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 23 ways as a sum of consecutive naturals, for example, 32415 + ... + 34135.
It is an arithmetic number, because the mean of its divisors is an integer number (3256302).
Almost surely, 257266275 is an apocalyptic number.
57266275 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
57266275 is a deficient number, since it is larger than the sum of its proper divisors (20884973).
57266275 is a wasteful number, since it uses less digits than its factorization.
57266275 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1764 (or 1737 counting only the distinct ones).
The product of its digits is 176400, while the sum is 40.
The square root of 57266275 is about 7567.4483810595. The cubic root of 57266275 is about 385.4484570158.
The spelling of 57266275 in words is "fifty-seven million, two hundred sixty-six thousand, two hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •