Base | Representation |
---|---|
bin | 11001001011111… |
… | …11010001000001 |
3 | 112201120101121111 |
4 | 30211333101001 |
5 | 413042110212 |
6 | 32544323321 |
7 | 5143615264 |
oct | 1445772101 |
9 | 481511544 |
10 | 211285057 |
11 | a92a0655 |
12 | 5a913541 |
13 | 34a08a59 |
14 | 200bccdb |
15 | 13837ea7 |
hex | c97f441 |
211285057 has 8 divisors (see below), whose sum is σ = 218408960. Its totient is φ = 204180480.
The previous prime is 211285007. The next prime is 211285079. The reversal of 211285057 is 750582112.
211285057 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 211285057 - 215 = 211252289 is a prime.
It is a super-2 number, since 2×2112850572 = 89282750622986498, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211285007) 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, 19408 + ... + 28270.
It is an arithmetic number, because the mean of its divisors is an integer number (27301120).
Almost surely, 2211285057 is an apocalyptic number.
It is an amenable number.
211285057 is a deficient number, since it is larger than the sum of its proper divisors (7123903).
211285057 is an equidigital number, since it uses as much as digits as its factorization.
211285057 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9663.
The product of its (nonzero) digits is 5600, while the sum is 31.
The square root of 211285057 is about 14535.6478011818. The cubic root of 211285057 is about 595.6021557383.
The spelling of 211285057 in words is "two hundred eleven million, two hundred eighty-five thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •