Base | Representation |
---|---|
bin | 1100010011010001100… |
… | …0000110010011010001 |
3 | 202012111002200112102222 |
4 | 3010310120012103101 |
5 | 11430302011130001 |
6 | 241030140550425 |
7 | 21161002315616 |
oct | 3046430062321 |
9 | 665432615388 |
10 | 211332130001 |
11 | 816975291a3 |
12 | 34b5a852415 |
13 | 16c0bcb3c45 |
14 | a32b12a50d |
15 | 576d26c61b |
hex | 31346064d1 |
211332130001 has 4 divisors (see below), whose sum is σ = 211335682404. Its totient is φ = 211328577600.
The previous prime is 211332129991. The next prime is 211332130019. The reversal of 211332130001 is 100031233112.
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 49789228225 + 161542901776 = 223135^2 + 401924^2 .
It is a cyclic number.
It is not a de Polignac number, because 211332130001 - 210 = 211332128977 is a prime.
It is a super-2 number, since 2×2113321300012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211332130081) 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, 1685420 + ... + 1806461.
It is an arithmetic number, because the mean of its divisors is an integer number (52833920601).
Almost surely, 2211332130001 is an apocalyptic number.
It is an amenable number.
211332130001 is a deficient number, since it is larger than the sum of its proper divisors (3552403).
211332130001 is an equidigital number, since it uses as much as digits as its factorization.
211332130001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3552402.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 211332130001 its reverse (100031233112), we get a palindrome (311363363113).
The spelling of 211332130001 in words is "two hundred eleven billion, three hundred thirty-two million, one hundred thirty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •