Base | Representation |
---|---|
bin | 1100010010111001101… |
… | …0100000111100000101 |
3 | 202012020010110111012212 |
4 | 3010232122200330011 |
5 | 11430100404200401 |
6 | 241012204553205 |
7 | 21155346140351 |
oct | 3045632407405 |
9 | 665203414185 |
10 | 211232100101 |
11 | 81646017260 |
12 | 34b31252805 |
13 | 16bc435c959 |
14 | a31bb2c461 |
15 | 57645addbb |
hex | 312e6a0f05 |
211232100101 has 8 divisors (see below), whose sum is σ = 243990019584. Its totient is φ = 180733347520.
The previous prime is 211232100083. The next prime is 211232100137. The reversal of 211232100101 is 101001232112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 211232100101 - 214 = 211232083717 is a prime.
It is a super-2 number, since 2×2112321001012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211232100301) 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 7 ways as a sum of consecutive naturals, for example, 564791525 + ... + 564791898.
It is an arithmetic number, because the mean of its divisors is an integer number (30498752448).
Almost surely, 2211232100101 is an apocalyptic number.
It is an amenable number.
211232100101 is a deficient number, since it is larger than the sum of its proper divisors (32757919483).
211232100101 is a wasteful number, since it uses less digits than its factorization.
211232100101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1129583451.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 211232100101 its reverse (101001232112), we get a palindrome (312233332213).
The spelling of 211232100101 in words is "two hundred eleven billion, two hundred thirty-two million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •