Base | Representation |
---|---|
bin | 1100010010100001100… |
… | …1010001010000011111 |
3 | 202011222002102200102201 |
4 | 3010220121101100133 |
5 | 11424344031013211 |
6 | 240554200232331 |
7 | 21153011554003 |
oct | 3045031212037 |
9 | 664862380381 |
10 | 211131110431 |
11 | 815a400a21a |
12 | 34b0346b6a7 |
13 | 16ba9460857 |
14 | a30c560703 |
15 | 575a7b10c1 |
hex | 312865141f |
211131110431 has 4 divisors (see below), whose sum is σ = 220310723952. Its totient is φ = 201951496912.
The previous prime is 211131110419. The next prime is 211131110447. The reversal of 211131110431 is 134011131112.
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 211131110431 - 29 = 211131109919 is a prime.
It is a super-2 number, since 2×2111311104312 (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 = 211131110399 and 211131110408.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211131170431) 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, 4589806726 + ... + 4589806771.
It is an arithmetic number, because the mean of its divisors is an integer number (55077680988).
Almost surely, 2211131110431 is an apocalyptic number.
211131110431 is a deficient number, since it is larger than the sum of its proper divisors (9179613521).
211131110431 is an equidigital number, since it uses as much as digits as its factorization.
211131110431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9179613520.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 211131110431 its reverse (134011131112), we get a palindrome (345142241543).
The spelling of 211131110431 in words is "two hundred eleven billion, one hundred thirty-one million, one hundred ten thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •