Base | Representation |
---|---|
bin | 110010000100011110100010… |
… | …110101101010100011001001 |
3 | 1001212200212111112112120002012 |
4 | 302010132202311222203021 |
5 | 212330410040023210441 |
6 | 2100203024424545305 |
7 | 64245435042562115 |
oct | 6204364265524311 |
9 | 1055625445476065 |
10 | 220210000210121 |
11 | 6419059a28a449 |
12 | 2084620b622235 |
13 | 95b4938623a7c |
14 | 3c5431413c745 |
15 | 1a6d27a2999eb |
hex | c847a2d6a8c9 |
220210000210121 has 12 divisors (see below), whose sum is σ = 237591552908400. Its totient is φ = 203531707481760.
The previous prime is 220210000210117. The next prime is 220210000210127. The reversal of 220210000210121 is 121012000012022.
It is not a de Polignac number, because 220210000210121 - 22 = 220210000210117 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 220210000210096 and 220210000210105.
It is not an unprimeable number, because it can be changed into a prime (220210000210127) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3447320831 + ... + 3447384708.
It is an arithmetic number, because the mean of its divisors is an integer number (19799296075700).
Almost surely, 2220210000210121 is an apocalyptic number.
It is an amenable number.
220210000210121 is a deficient number, since it is larger than the sum of its proper divisors (17381552698279).
220210000210121 is an equidigital number, since it uses as much as digits as its factorization.
220210000210121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6894705640 (or 6894705599 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 220210000210121 its reverse (121012000012022), we get a palindrome (341222000222143).
The spelling of 220210000210121 in words is "two hundred twenty trillion, two hundred ten billion, two hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •