Base | Representation |
---|---|
bin | 1100010010011111001… |
… | …0101101001000110011 |
3 | 202011221101102001220202 |
4 | 3010213302231020303 |
5 | 11424333434013021 |
6 | 240553155425415 |
7 | 21152526620324 |
oct | 3044762551063 |
9 | 664841361822 |
10 | 211121001011 |
11 | 81599334928 |
12 | 34abbbb526b |
13 | 16ba733124b |
14 | a30b08c44b |
15 | 5759965a0b |
hex | 3127cad233 |
211121001011 has 32 divisors (see below), whose sum is σ = 225182080512. Its totient is φ = 197519351040.
The previous prime is 211121000983. The next prime is 211121001017. The reversal of 211121001011 is 110100121112.
211121001011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 211121001011 - 26 = 211121000947 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 211121000983 and 211121001001.
It is not an unprimeable number, because it can be changed into a prime (211121001017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 163532276 + ... + 163533566.
It is an arithmetic number, because the mean of its divisors is an integer number (7036940016).
Almost surely, 2211121001011 is an apocalyptic number.
211121001011 is a deficient number, since it is larger than the sum of its proper divisors (14061079501).
211121001011 is a wasteful number, since it uses less digits than its factorization.
211121001011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2123.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 211121001011 its reverse (110100121112), we get a palindrome (321221122123).
The spelling of 211121001011 in words is "two hundred eleven billion, one hundred twenty-one million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •