Base | Representation |
---|---|
bin | 1100010011010001000… |
… | …1000111100011001111 |
3 | 202012110222020120022021 |
4 | 3010310101013203033 |
5 | 11430301024100421 |
6 | 241030033431011 |
7 | 21160650624640 |
oct | 3046421074317 |
9 | 665428216267 |
10 | 211330300111 |
11 | 81696499397 |
12 | 34b5a10b467 |
13 | 16c0b7c3078 |
14 | a32abb16c7 |
15 | 576d00a341 |
hex | 31344478cf |
211330300111 has 8 divisors (see below), whose sum is σ = 243657692064. Its totient is φ = 179537245440.
The previous prime is 211330300099. The next prime is 211330300123. The reversal of 211330300111 is 111003033112.
It is an interprime number because it is at equal distance from previous prime (211330300099) and next prime (211330300123).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 211330300111 - 29 = 211330299599 is a prime.
It is a super-2 number, since 2×2113303001112 (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 (211330300711) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 133583470 + ... + 133585051.
It is an arithmetic number, because the mean of its divisors is an integer number (30457211508).
Almost surely, 2211330300111 is an apocalyptic number.
211330300111 is a deficient number, since it is larger than the sum of its proper divisors (32327391953).
211330300111 is a wasteful number, since it uses less digits than its factorization.
211330300111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 267168641.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 211330300111 its reverse (111003033112), we get a palindrome (322333333223).
The spelling of 211330300111 in words is "two hundred eleven billion, three hundred thirty million, three hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •