Base | Representation |
---|---|
bin | 111111001011110… |
… | …0101010001110110 |
3 | 12110202100210211212 |
4 | 1332113211101312 |
5 | 13320222024342 |
6 | 550213201422 |
7 | 103352435165 |
oct | 17627452166 |
9 | 5422323755 |
10 | 2120111222 |
11 | 998824a39 |
12 | 4b2030272 |
13 | 27a30caa8 |
14 | 1618033dc |
15 | c61db182 |
hex | 7e5e5476 |
2120111222 has 8 divisors (see below), whose sum is σ = 3193363272. Its totient is φ = 1055656800.
The previous prime is 2120111221. The next prime is 2120111233. The reversal of 2120111222 is 2221110212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 2120111197 and 2120111206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2120111221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2198804 + ... + 2199767.
It is an arithmetic number, because the mean of its divisors is an integer number (399170409).
Almost surely, 22120111222 is an apocalyptic number.
2120111222 is a deficient number, since it is larger than the sum of its proper divisors (1073252050).
2120111222 is a wasteful number, since it uses less digits than its factorization.
2120111222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4398814.
The product of its (nonzero) digits is 32, while the sum is 14.
The square root of 2120111222 is about 46044.6655107842. The cubic root of 2120111222 is about 1284.6541226187.
Adding to 2120111222 its reverse (2221110212), we get a palindrome (4341221434).
It can be divided in two parts, 21201 and 11222, that added together give a palindrome (32423).
The spelling of 2120111222 in words is "two billion, one hundred twenty million, one hundred eleven thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •