Base | Representation |
---|---|
bin | 11001001101000… |
… | …00110001011101 |
3 | 112201211100212121 |
4 | 30212200301131 |
5 | 413111003201 |
6 | 32551302541 |
7 | 5145026356 |
oct | 1446406135 |
9 | 481740777 |
10 | 211422301 |
11 | a9384782 |
12 | 5a97aa51 |
13 | 34a5636c |
14 | 20116d2d |
15 | 138639a1 |
hex | c9a0c5d |
211422301 has 4 divisors (see below), whose sum is σ = 211724604. Its totient is φ = 211120000.
The previous prime is 211422257. The next prime is 211422307. The reversal of 211422301 is 103224112.
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 176624100 + 34798201 = 13290^2 + 5899^2 .
It is a cyclic number.
It is not a de Polignac number, because 211422301 - 215 = 211389533 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211422307) 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 in 3 ways as a sum of consecutive naturals, for example, 150100 + ... + 151501.
It is an arithmetic number, because the mean of its divisors is an integer number (52931151).
Almost surely, 2211422301 is an apocalyptic number.
It is an amenable number.
211422301 is a deficient number, since it is larger than the sum of its proper divisors (302303).
211422301 is an equidigital number, since it uses as much as digits as its factorization.
211422301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 302302.
The product of its (nonzero) digits is 96, while the sum is 16.
The square root of 211422301 is about 14540.3679802129. The cubic root of 211422301 is about 595.7310891812.
Adding to 211422301 its reverse (103224112), we get a palindrome (314646413).
The spelling of 211422301 in words is "two hundred eleven million, four hundred twenty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •