Base | Representation |
---|---|
bin | 1100010010011111001… |
… | …1111000100101001111 |
3 | 202011221101222202210221 |
4 | 3010213303320211033 |
5 | 11424334023410111 |
6 | 240553210212211 |
7 | 21152532345262 |
oct | 3044763704517 |
9 | 664841882727 |
10 | 211121310031 |
11 | 81599526015 |
12 | 34b00124067 |
13 | 16ba740bab8 |
14 | a30b12ccd9 |
15 | 57599c7371 |
hex | 3127cf894f |
211121310031 has 4 divisors (see below), whose sum is σ = 211573390392. Its totient is φ = 210669229672.
The previous prime is 211121309983. The next prime is 211121310091. The reversal of 211121310031 is 130013121112.
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 211121310031 - 217 = 211121178959 is a prime.
It is a super-2 number, since 2×2111213100312 (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 = 211121309987 and 211121310014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211121310091) 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, 226039480 + ... + 226040413.
It is an arithmetic number, because the mean of its divisors is an integer number (52893347598).
Almost surely, 2211121310031 is an apocalyptic number.
211121310031 is a deficient number, since it is larger than the sum of its proper divisors (452080361).
211121310031 is an equidigital number, since it uses as much as digits as its factorization.
211121310031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 452080360.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 211121310031 its reverse (130013121112), we get a palindrome (341134431143).
The spelling of 211121310031 in words is "two hundred eleven billion, one hundred twenty-one million, three hundred ten thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •