Base | Representation |
---|---|
bin | 11001001100000… |
… | …11001001100001 |
3 | 112201121012102112 |
4 | 30212003021201 |
5 | 413043112321 |
6 | 32544525105 |
7 | 5144012534 |
oct | 1446031141 |
9 | 481535375 |
10 | 211300961 |
11 | a93015a3 |
12 | 5a920795 |
13 | 34a13071 |
14 | 200c4a1b |
15 | 1383ca5b |
hex | c983261 |
211300961 has 4 divisors (see below), whose sum is σ = 211476372. Its totient is φ = 211125552.
The previous prime is 211300951. The next prime is 211300963. The reversal of 211300961 is 169003112.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 53949025 + 157351936 = 7345^2 + 12544^2 .
It is a cyclic number.
It is not a de Polignac number, because 211300961 - 222 = 207106657 is a prime.
It is a super-2 number, since 2×2113009612 = 89296192239047042, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211300963) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 85886 + ... + 88311.
It is an arithmetic number, because the mean of its divisors is an integer number (52869093).
Almost surely, 2211300961 is an apocalyptic number.
It is an amenable number.
211300961 is a deficient number, since it is larger than the sum of its proper divisors (175411).
211300961 is a wasteful number, since it uses less digits than its factorization.
211300961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 175410.
The product of its (nonzero) digits is 324, while the sum is 23.
The square root of 211300961 is about 14536.1948597286. The cubic root of 211300961 is about 595.6170995606.
The spelling of 211300961 in words is "two hundred eleven million, three hundred thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •