Base | Representation |
---|---|
bin | 1100010010100001011… |
… | …0010001000111100111 |
3 | 202011222000221200212120 |
4 | 3010220112101013213 |
5 | 11424343330322211 |
6 | 240554131321023 |
7 | 21153002065356 |
oct | 3045026210747 |
9 | 664860850776 |
10 | 211130323431 |
11 | 815a3621a05 |
12 | 34b03150173 |
13 | 16ba9246581 |
14 | a30c3d799d |
15 | 575a6a7d06 |
hex | 31285911e7 |
211130323431 has 4 divisors (see below), whose sum is σ = 281507097912. Its totient is φ = 140753548952.
The previous prime is 211130323399. The next prime is 211130323433. The reversal of 211130323431 is 134323031112.
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 211130323431 - 25 = 211130323399 is a prime.
It is a super-2 number, since 2×2111303234312 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211130323433) 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 3 ways as a sum of consecutive naturals, for example, 35188387236 + ... + 35188387241.
It is an arithmetic number, because the mean of its divisors is an integer number (70376774478).
Almost surely, 2211130323431 is an apocalyptic number.
211130323431 is a deficient number, since it is larger than the sum of its proper divisors (70376774481).
211130323431 is an equidigital number, since it uses as much as digits as its factorization.
211130323431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70376774480.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 211130323431 its reverse (134323031112), we get a palindrome (345453354543).
The spelling of 211130323431 in words is "two hundred eleven billion, one hundred thirty million, three hundred twenty-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •