Base | Representation |
---|---|
bin | 101111111110101111111111… |
… | …111000110101110010001111 |
3 | 1000200011100100201020022022120 |
4 | 233332233333320311302033 |
5 | 210124324114303411343 |
6 | 2024445222451344023 |
7 | 62306500346011101 |
oct | 5776577770656217 |
9 | 1020140321208276 |
10 | 211020331310223 |
11 | 61268246810586 |
12 | 1b8011a1bb2013 |
13 | 90991938cbac6 |
14 | 3a1761d485571 |
15 | 195e1ca60a683 |
hex | bfebffe35c8f |
211020331310223 has 8 divisors (see below), whose sum is σ = 282095064311808. Its totient is φ = 140312909591064.
The previous prime is 211020331310213. The next prime is 211020331310231. The reversal of 211020331310223 is 322013133020112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-211020331310223 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 211020331310193 and 211020331310202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211020331310213) 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, 91827819265 + ... + 91827821562.
It is an arithmetic number, because the mean of its divisors is an integer number (35261883038976).
Almost surely, 2211020331310223 is an apocalyptic number.
211020331310223 is a deficient number, since it is larger than the sum of its proper divisors (71074733001585).
211020331310223 is a wasteful number, since it uses less digits than its factorization.
211020331310223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 183655641213.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 211020331310223 its reverse (322013133020112), we get a palindrome (533033464330335).
The spelling of 211020331310223 in words is "two hundred eleven trillion, twenty billion, three hundred thirty-one million, three hundred ten thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •