Base | Representation |
---|---|
bin | 11001001101010… |
… | …00110001110001 |
3 | 112201220000211222 |
4 | 30212220301301 |
5 | 413113030324 |
6 | 32552114425 |
7 | 5145224066 |
oct | 1446506161 |
9 | 481800758 |
10 | 211455089 |
11 | a93a737a |
12 | 5a995a15 |
13 | 34a68271 |
14 | 20124c6d |
15 | 1386d55e |
hex | c9a8c71 |
211455089 has 2 divisors, whose sum is σ = 211455090. Its totient is φ = 211455088.
The previous prime is 211455073. The next prime is 211455103. The reversal of 211455089 is 980554112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 197824225 + 13630864 = 14065^2 + 3692^2 .
It is a cyclic number.
It is not a de Polignac number, because 211455089 - 24 = 211455073 is a prime.
It is a super-3 number, since 3×2114550893 (a number of 26 digits) contains 333 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is equal to p11677436 and since 211455089 and 11677436 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (211455019) 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 as a sum of consecutive naturals, namely, 105727544 + 105727545.
It is an arithmetic number, because the mean of its divisors is an integer number (105727545).
Almost surely, 2211455089 is an apocalyptic number.
It is an amenable number.
211455089 is a deficient number, since it is larger than the sum of its proper divisors (1).
211455089 is an equidigital number, since it uses as much as digits as its factorization.
211455089 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14400, while the sum is 35.
The square root of 211455089 is about 14541.4954182849. The cubic root of 211455089 is about 595.7618835064.
The spelling of 211455089 in words is "two hundred eleven million, four hundred fifty-five thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •