Base | Representation |
---|---|
bin | 11001001100010… |
… | …00000111100001 |
3 | 112201122020100022 |
4 | 30212020013201 |
5 | 413044240223 |
6 | 32545203225 |
7 | 5144126060 |
oct | 1446100741 |
9 | 481566308 |
10 | 211321313 |
11 | a9315915 |
12 | 5a930515 |
13 | 34a1c3c8 |
14 | 200cc1d7 |
15 | 13843ac8 |
hex | c9881e1 |
211321313 has 4 divisors (see below), whose sum is σ = 241510080. Its totient is φ = 181132548.
The previous prime is 211321291. The next prime is 211321321. The reversal of 211321313 is 313123112.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-211321313 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 211321291 and 211321300.
It is not an unprimeable number, because it can be changed into a prime (211321343) 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, 15094373 + ... + 15094386.
It is an arithmetic number, because the mean of its divisors is an integer number (60377520).
Almost surely, 2211321313 is an apocalyptic number.
It is an amenable number.
211321313 is a deficient number, since it is larger than the sum of its proper divisors (30188767).
211321313 is an equidigital number, since it uses as much as digits as its factorization.
211321313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30188766.
The product of its digits is 108, while the sum is 17.
The square root of 211321313 is about 14536.8948885242. The cubic root of 211321313 is about 595.6362217485.
Adding to 211321313 its reverse (313123112), we get a palindrome (524444425).
The spelling of 211321313 in words is "two hundred eleven million, three hundred twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •