Base | Representation |
---|---|
bin | 110000000000000011100111… |
… | …001011001110000010111001 |
3 | 1000200110221002121120122201110 |
4 | 300000003213023032002321 |
5 | 210132312001404323001 |
6 | 2024554351322110533 |
7 | 62316126231613626 |
oct | 6000034713160271 |
9 | 1020427077518643 |
10 | 211110111011001 |
11 | 612a23280445a4 |
12 | 1b81667904b449 |
13 | 90a47a0baa3c7 |
14 | 3a1bad8dd934d |
15 | 19616d246d3d6 |
hex | c000e72ce0b9 |
211110111011001 has 32 divisors (see below), whose sum is σ = 295764373669248. Its totient is φ = 133795104168960.
The previous prime is 211110111010987. The next prime is 211110111011029. The reversal of 211110111011001 is 100110111011112.
It is not a de Polignac number, because 211110111011001 - 29 = 211110111010489 is a prime.
It is not an unprimeable number, because it can be changed into a prime (211110111012001) 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, 73031931 + ... + 75867536.
It is an arithmetic number, because the mean of its divisors is an integer number (9242636677164).
Almost surely, 2211110111011001 is an apocalyptic number.
It is an amenable number.
211110111011001 is a deficient number, since it is larger than the sum of its proper divisors (84654262658247).
211110111011001 is a wasteful number, since it uses less digits than its factorization.
211110111011001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148899801.
The product of its (nonzero) digits is 2, while the sum is 12.
Adding to 211110111011001 its reverse (100110111011112), we get a palindrome (311220222022113).
It can be divided in two parts, 211110 and 111011001, that added together give a palindrome (111222111).
The spelling of 211110111011001 in words is "two hundred eleven trillion, one hundred ten billion, one hundred eleven million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •