Base | Representation |
---|---|
bin | 1100010011001001110… |
… | …1100010010111000101 |
3 | 202012101212020020001011 |
4 | 3010302131202113011 |
5 | 11430220300014341 |
6 | 241023032202221 |
7 | 21160132242661 |
oct | 3046235422705 |
9 | 665355206034 |
10 | 211300001221 |
11 | 81680384391 |
12 | 34b4bb39371 |
13 | 16c0544502a |
14 | a326b658a1 |
15 | 576a522b81 |
hex | 31327625c5 |
211300001221 has 4 divisors (see below), whose sum is σ = 211300920972. Its totient is φ = 211299081472.
The previous prime is 211300001219. The next prime is 211300001257. The reversal of 211300001221 is 122100003112.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 106693036321 + 104606964900 = 326639^2 + 323430^2 .
It is a cyclic number.
It is not a de Polignac number, because 211300001221 - 21 = 211300001219 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 (211300001261) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 209535 + ... + 683011.
It is an arithmetic number, because the mean of its divisors is an integer number (52825230243).
Almost surely, 2211300001221 is an apocalyptic number.
It is an amenable number.
211300001221 is a deficient number, since it is larger than the sum of its proper divisors (919751).
211300001221 is an equidigital number, since it uses as much as digits as its factorization.
211300001221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 919750.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 211300001221 its reverse (122100003112), we get a palindrome (333400004333).
The spelling of 211300001221 in words is "two hundred eleven billion, three hundred million, one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •