Base | Representation |
---|---|
bin | 1100010011101001010… |
… | …1111011010100011111 |
3 | 202012202002000211122021 |
4 | 3010322111323110133 |
5 | 11431003122132111 |
6 | 241044114201011 |
7 | 21163326152140 |
oct | 3047225732437 |
9 | 665662024567 |
10 | 211432224031 |
11 | 81738a84336 |
12 | 34b88283167 |
13 | 16c2695b492 |
14 | a33a543ac7 |
15 | 5776e3ed71 |
hex | 313a57b51f |
211432224031 has 4 divisors (see below), whose sum is σ = 241636827472. Its totient is φ = 181227620592.
The previous prime is 211432224007. The next prime is 211432224037. The reversal of 211432224031 is 130422234112.
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 211432224031 - 223 = 211423835423 is a prime.
It is a super-2 number, since 2×2114322240312 (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 = 211432223987 and 211432224005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211432224037) 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, 15102301710 + ... + 15102301723.
It is an arithmetic number, because the mean of its divisors is an integer number (60409206868).
Almost surely, 2211432224031 is an apocalyptic number.
211432224031 is a deficient number, since it is larger than the sum of its proper divisors (30204603441).
211432224031 is an equidigital number, since it uses as much as digits as its factorization.
211432224031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30204603440.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 211432224031 its reverse (130422234112), we get a palindrome (341854458143).
The spelling of 211432224031 in words is "two hundred eleven billion, four hundred thirty-two million, two hundred twenty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •