Base | Representation |
---|---|
bin | 11001001110011… |
… | …01001010111101 |
3 | 112202011121100000 |
4 | 30213031022331 |
5 | 413132313112 |
6 | 32555224513 |
7 | 5146414512 |
oct | 1447151275 |
9 | 482147300 |
10 | 211604157 |
11 | a9499376 |
12 | 5aa48139 |
13 | 34abb07b |
14 | 20163309 |
15 | 1389c7dc |
hex | c9cd2bd |
211604157 has 48 divisors (see below), whose sum is σ = 330587712. Its totient is φ = 135146880.
The previous prime is 211604137. The next prime is 211604167. The reversal of 211604157 is 751406112.
It is a happy number.
211604157 is a `hidden beast` number, since 2 + 1 + 1 + 604 + 1 + 57 = 666.
It is not a de Polignac number, because 211604157 - 214 = 211587773 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 211604157.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211604137) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 667363 + ... + 667679.
It is an arithmetic number, because the mean of its divisors is an integer number (6887244).
Almost surely, 2211604157 is an apocalyptic number.
211604157 is a gapful number since it is divisible by the number (27) formed by its first and last digit.
It is an amenable number.
211604157 is a deficient number, since it is larger than the sum of its proper divisors (118983555).
211604157 is an equidigital number, since it uses as much as digits as its factorization.
211604157 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 440 (or 428 counting only the distinct ones).
The product of its (nonzero) digits is 1680, while the sum is 27.
The square root of 211604157 is about 14546.6201229014. The cubic root of 211604157 is about 595.9018473036.
The spelling of 211604157 in words is "two hundred eleven million, six hundred four thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •