Base | Representation |
---|---|
bin | 1100010010110100101… |
… | …0110111010000111111 |
3 | 202012011200011200010221 |
4 | 3010231022313100333 |
5 | 11430030033020111 |
6 | 241010141242211 |
7 | 21155003514460 |
oct | 3045512672077 |
9 | 665150150127 |
10 | 211211220031 |
11 | 816352557a9 |
12 | 34b26263367 |
13 | 16bbcc2ba96 |
14 | a319054d67 |
15 | 5762837371 |
hex | 312d2b743f |
211211220031 has 8 divisors (see below), whose sum is σ = 241389850784. Its totient is φ = 181033989120.
The previous prime is 211211220001. The next prime is 211211220079. The reversal of 211211220031 is 130022112112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 211211220031 - 213 = 211211211839 is a prime.
It is a super-2 number, since 2×2112112200312 (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 = 211211219987 and 211211220014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211211220001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3810 + ... + 649951.
It is an arithmetic number, because the mean of its divisors is an integer number (30173731348).
Almost surely, 2211211220031 is an apocalyptic number.
211211220031 is a deficient number, since it is larger than the sum of its proper divisors (30178630753).
211211220031 is an equidigital number, since it uses as much as digits as its factorization.
211211220031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 699921.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 211211220031 its reverse (130022112112), we get a palindrome (341233332143).
The spelling of 211211220031 in words is "two hundred eleven billion, two hundred eleven million, two hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •