Base | Representation |
---|---|
bin | 111110111100101… |
… | …1110101111011001 |
3 | 12110012111220021212 |
4 | 1331321132233121 |
5 | 13311212020441 |
6 | 545332112505 |
7 | 103225401104 |
oct | 17571365731 |
9 | 5405456255 |
10 | 2112220121 |
11 | 994325270 |
12 | 4ab465735 |
13 | 2787a90bb |
14 | 16074b73b |
15 | c567ceeb |
hex | 7de5ebd9 |
2112220121 has 8 divisors (see below), whose sum is σ = 2306100000. Its totient is φ = 1918650240.
The previous prime is 2112220079. The next prime is 2112220151. The reversal of 2112220121 is 1210222112.
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 2112220121 - 26 = 2112220057 is a prime.
It is a super-2 number, since 2×21122201212 = 8922947679114509282, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2112220096 and 2112220105.
It is not an unprimeable number, because it can be changed into a prime (2112220151) 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, 63131 + ... + 90608.
It is an arithmetic number, because the mean of its divisors is an integer number (288262500).
Almost surely, 22112220121 is an apocalyptic number.
It is an amenable number.
2112220121 is a deficient number, since it is larger than the sum of its proper divisors (193879879).
2112220121 is a wasteful number, since it uses less digits than its factorization.
2112220121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 154999.
The product of its (nonzero) digits is 32, while the sum is 14.
The square root of 2112220121 is about 45958.8959941381. The cubic root of 2112220121 is about 1283.0583040398.
Adding to 2112220121 its reverse (1210222112), we get a palindrome (3322442233).
The spelling of 2112220121 in words is "two billion, one hundred twelve million, two hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •