Base | Representation |
---|---|
bin | 110101010010000001… |
… | …111101011001101001 |
3 | 12110200010020210100201 |
4 | 311102001331121221 |
5 | 1414131432221301 |
6 | 42140550232201 |
7 | 4063510643113 |
oct | 652201753151 |
9 | 173603223321 |
10 | 57210820201 |
11 | 2229901aa97 |
12 | b107955661 |
13 | 551994ac42 |
14 | 2aaa2883b3 |
15 | 174c954201 |
hex | d5207d669 |
57210820201 has 8 divisors (see below), whose sum is σ = 57775835520. Its totient is φ = 56648415312.
The previous prime is 57210820193. The next prime is 57210820217. The reversal of 57210820201 is 10202801275.
57210820201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 57210820201 - 23 = 57210820193 is a prime.
It is a super-2 number, since 2×572108202012 (a number of 22 digits) 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 57210820201.
It is not an unprimeable number, because it can be changed into a prime (57210820231) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 608545 + ... + 696238.
It is an arithmetic number, because the mean of its divisors is an integer number (7221979440).
Almost surely, 257210820201 is an apocalyptic number.
It is an amenable number.
57210820201 is a deficient number, since it is larger than the sum of its proper divisors (565015319).
57210820201 is a wasteful number, since it uses less digits than its factorization.
57210820201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1305215.
The product of its (nonzero) digits is 2240, while the sum is 28.
The spelling of 57210820201 in words is "fifty-seven billion, two hundred ten million, eight hundred twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •