Base | Representation |
---|---|
bin | 1100010011001110101… |
… | …0001111111110110111 |
3 | 202012110021001220111221 |
4 | 3010303222033332313 |
5 | 11430240422023111 |
6 | 241025031211211 |
7 | 21160465210111 |
oct | 3046352177667 |
9 | 665407056457 |
10 | 211320111031 |
11 | 8169076a167 |
12 | 34b56816b07 |
13 | 16c09666423 |
14 | a3296bc3b1 |
15 | 576c196371 |
hex | 3133a8ffb7 |
211320111031 has 4 divisors (see below), whose sum is σ = 211322428864. Its totient is φ = 211317793200.
The previous prime is 211320111029. The next prime is 211320111047. The reversal of 211320111031 is 130111023112.
It is a happy number.
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 211320111031 - 21 = 211320111029 is a prime.
It is a super-2 number, since 2×2113201110312 (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 = 211320110996 and 211320111014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211320111001) 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, 1016310 + ... + 1206451.
It is an arithmetic number, because the mean of its divisors is an integer number (52830607216).
Almost surely, 2211320111031 is an apocalyptic number.
211320111031 is a deficient number, since it is larger than the sum of its proper divisors (2317833).
211320111031 is an equidigital number, since it uses as much as digits as its factorization.
211320111031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2317832.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 211320111031 its reverse (130111023112), we get a palindrome (341431134143).
The spelling of 211320111031 in words is "two hundred eleven billion, three hundred twenty million, one hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •