Base | Representation |
---|---|
bin | 1100010010011010011… |
… | …0011111010000010001 |
3 | 202011212222210222202210 |
4 | 3010212212133100101 |
5 | 11424313330134301 |
6 | 240551203302333 |
7 | 21152165034210 |
oct | 3044646372021 |
9 | 664788728683 |
10 | 211101021201 |
11 | 81589028794 |
12 | 34ab537a9a9 |
13 | 16ba3157085 |
14 | a30856b077 |
15 | 5757d1aad6 |
hex | 312699f411 |
211101021201 has 32 divisors (see below), whose sum is σ = 322312032000. Its totient is φ = 120391557120.
The previous prime is 211101021179. The next prime is 211101021223. The reversal of 211101021201 is 102120101112.
It is an interprime number because it is at equal distance from previous prime (211101021179) and next prime (211101021223).
It is not a de Polignac number, because 211101021201 - 26 = 211101021137 is a prime.
It is not an unprimeable number, because it can be changed into a prime (211101021281) 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 31 ways as a sum of consecutive naturals, for example, 24425841 + ... + 24434481.
It is an arithmetic number, because the mean of its divisors is an integer number (10072251000).
Almost surely, 2211101021201 is an apocalyptic number.
211101021201 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
211101021201 is a deficient number, since it is larger than the sum of its proper divisors (111211010799).
211101021201 is a wasteful number, since it uses less digits than its factorization.
211101021201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10809.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 211101021201 its reverse (102120101112), we get a palindrome (313221122313).
The spelling of 211101021201 in words is "two hundred eleven billion, one hundred one million, twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •