Base | Representation |
---|---|
bin | 1000001100100100… |
… | …1011000111011001 |
3 | 12200100002202121010 |
4 | 2003021023013121 |
5 | 14001224020441 |
6 | 1002154204133 |
7 | 105344363631 |
oct | 20311130731 |
9 | 5610082533 |
10 | 2200220121 |
11 | a29a6aa40 |
12 | 514a23649 |
13 | 290aaa8c8 |
14 | 16c2d76c1 |
15 | cd262116 |
hex | 8324b1d9 |
2200220121 has 32 divisors (see below), whose sum is σ = 3566937600. Its totient is φ = 1188967680.
The previous prime is 2200220119. The next prime is 2200220123. The reversal of 2200220121 is 1210220022.
It is an interprime number because it is at equal distance from previous prime (2200220119) and next prime (2200220123).
It is not a de Polignac number, because 2200220121 - 21 = 2200220119 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2200220097 and 2200220106.
It is not an unprimeable number, because it can be changed into a prime (2200220123) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 92551 + ... + 113868.
It is an arithmetic number, because the mean of its divisors is an integer number (111466800).
Almost surely, 22200220121 is an apocalyptic number.
It is an amenable number.
2200220121 is a deficient number, since it is larger than the sum of its proper divisors (1366717479).
2200220121 is a wasteful number, since it uses less digits than its factorization.
2200220121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 206469.
The product of its (nonzero) digits is 32, while the sum is 12.
The square root of 2200220121 is about 46906.5040372868. The cubic root of 2200220121 is about 1300.6348222972.
Adding to 2200220121 its reverse (1210220022), we get a palindrome (3410440143).
Subtracting from 2200220121 its reverse (1210220022), we obtain a palindrome (990000099).
The spelling of 2200220121 in words is "two billion, two hundred million, two hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •