Base | Representation |
---|---|
bin | 1100010010100000011… |
… | …0010001110100111111 |
3 | 202011221202001202100112 |
4 | 3010220012101310333 |
5 | 11424341242211111 |
6 | 240553501420235 |
7 | 21152621340503 |
oct | 3045006216477 |
9 | 664852052315 |
10 | 211126132031 |
11 | 815a1219941 |
12 | 34b0186a67b |
13 | 16ba8409859 |
14 | a30ba26303 |
15 | 575a12ae8b |
hex | 3128191d3f |
211126132031 has 4 divisors (see below), whose sum is σ = 211148743464. Its totient is φ = 211103520600.
The previous prime is 211126132027. The next prime is 211126132037. The reversal of 211126132031 is 130231621112.
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 211126132031 - 22 = 211126132027 is a prime.
It is a super-2 number, since 2×2111261320312 (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 = 211126131988 and 211126132006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211126132037) 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, 11291705 + ... + 11310386.
It is an arithmetic number, because the mean of its divisors is an integer number (52787185866).
Almost surely, 2211126132031 is an apocalyptic number.
211126132031 is a deficient number, since it is larger than the sum of its proper divisors (22611433).
211126132031 is an equidigital number, since it uses as much as digits as its factorization.
211126132031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22611432.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 211126132031 its reverse (130231621112), we get a palindrome (341357753143).
The spelling of 211126132031 in words is "two hundred eleven billion, one hundred twenty-six million, one hundred thirty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •