Base | Representation |
---|---|
bin | 1100010011001111010… |
… | …1101001110001000111 |
3 | 202012110110200202221001 |
4 | 3010303311221301013 |
5 | 11430242203201411 |
6 | 241025215234131 |
7 | 21160532500015 |
oct | 3046365516107 |
9 | 665413622831 |
10 | 211323100231 |
11 | 81692420a81 |
12 | 34b57818947 |
13 | 16c0a171b99 |
14 | a329c598b5 |
15 | 576c586dc1 |
hex | 3133d69c47 |
211323100231 has 4 divisors (see below), whose sum is σ = 218139974464. Its totient is φ = 204506226000.
The previous prime is 211323100211. The next prime is 211323100249. The reversal of 211323100231 is 132001323112.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 211323100231 - 211 = 211323098183 is a prime.
It is a super-2 number, since 2×2113231002312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 211323100199 and 211323100208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211323100211) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3408437070 + ... + 3408437131.
It is an arithmetic number, because the mean of its divisors is an integer number (54534993616).
Almost surely, 2211323100231 is an apocalyptic number.
211323100231 is a deficient number, since it is larger than the sum of its proper divisors (6816874233).
211323100231 is an equidigital number, since it uses as much as digits as its factorization.
211323100231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6816874232.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 211323100231 its reverse (132001323112), we get a palindrome (343324423343).
The spelling of 211323100231 in words is "two hundred eleven billion, three hundred twenty-three million, one hundred thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •