Base | Representation |
---|---|
bin | 1100010010110111100… |
… | …0010011001111110001 |
3 | 202012012111120211002102 |
4 | 3010231320103033301 |
5 | 11430041110143441 |
6 | 241011244430145 |
7 | 21155206663622 |
oct | 3045570231761 |
9 | 665174524072 |
10 | 211223131121 |
11 | 81640a50782 |
12 | 34b2a248355 |
13 | 16bc253c472 |
14 | a31a875a49 |
15 | 57638db69b |
hex | 312de133f1 |
211223131121 has 8 divisors (see below), whose sum is σ = 218061886464. Its totient is φ = 204385944960.
The previous prime is 211223131117. The next prime is 211223131123. The reversal of 211223131121 is 121131322112.
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 211223131121 - 22 = 211223131117 is a prime.
It is a super-2 number, since 2×2112231311212 (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 = 211223131093 and 211223131102.
It is not an unprimeable number, because it can be changed into a prime (211223131123) 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, 115616 + ... + 660161.
It is an arithmetic number, because the mean of its divisors is an integer number (27257735808).
Almost surely, 2211223131121 is an apocalyptic number.
It is an amenable number.
211223131121 is a deficient number, since it is larger than the sum of its proper divisors (6838755343).
211223131121 is an equidigital number, since it uses as much as digits as its factorization.
211223131121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 784591.
The product of its digits is 144, while the sum is 20.
Adding to 211223131121 its reverse (121131322112), we get a palindrome (332354453233).
The spelling of 211223131121 in words is "two hundred eleven billion, two hundred twenty-three million, one hundred thirty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •