Base | Representation |
---|---|
bin | 1100010010011101000… |
… | …0110101001010101001 |
3 | 202011220202200220211111 |
4 | 3010213100311022221 |
5 | 11424324200333001 |
6 | 240552241230321 |
7 | 21152361264145 |
oct | 3044720651251 |
9 | 664822626744 |
10 | 211112121001 |
11 | 8159431a181 |
12 | 34ab90323a1 |
13 | 16ba55423c2 |
14 | a309c1a225 |
15 | 5758cae851 |
hex | 31274352a9 |
211112121001 has 4 divisors (see below), whose sum is σ = 211114918404. Its totient is φ = 211109323600.
The previous prime is 211112120981. The next prime is 211112121007. The reversal of 211112121001 is 100121211112.
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 159401361001 + 51710760000 = 399251^2 + 227400^2 .
It is a cyclic number.
It is not a de Polignac number, because 211112121001 - 233 = 202522186409 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211112121007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1282270 + ... + 1437511.
It is an arithmetic number, because the mean of its divisors is an integer number (52778729601).
Almost surely, 2211112121001 is an apocalyptic number.
It is an amenable number.
211112121001 is a deficient number, since it is larger than the sum of its proper divisors (2797403).
211112121001 is an equidigital number, since it uses as much as digits as its factorization.
211112121001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2797402.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 211112121001 its reverse (100121211112), we get a palindrome (311233332113).
The spelling of 211112121001 in words is "two hundred eleven billion, one hundred twelve million, one hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •