Base | Representation |
---|---|
bin | 110010000011001100101000… |
… | …001100101100101100000001 |
3 | 1001212101110110200002210211122 |
4 | 302003030220030230230001 |
5 | 212322434421041222310 |
6 | 2100054400511122025 |
7 | 64236202302324413 |
oct | 6203145014545401 |
9 | 1055343420083748 |
10 | 220122043304705 |
11 | 6415726396a583 |
12 | 20831162b13315 |
13 | 95a955bb870c9 |
14 | 3c4dd6c7169b3 |
15 | 1a6ad2d494555 |
hex | c8332832cb01 |
220122043304705 has 16 divisors (see below), whose sum is σ = 270597040522704. Its totient is φ = 171797495992320.
The previous prime is 220122043304699. The next prime is 220122043304707. The reversal of 220122043304705 is 507403340221022.
It can be written as a sum of positive squares in 8 ways, for example, as 65219724712129 + 154902318592576 = 8075873^2 + 12445976^2 .
It is not a de Polignac number, because 220122043304705 - 212 = 220122043300609 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (220122043304707) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8892464 + ... + 22788593.
It is an arithmetic number, because the mean of its divisors is an integer number (16912315032669).
Almost surely, 2220122043304705 is an apocalyptic number.
It is an amenable number.
220122043304705 is a deficient number, since it is larger than the sum of its proper divisors (50474997217999).
220122043304705 is a wasteful number, since it uses less digits than its factorization.
220122043304705 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31714996.
The product of its (nonzero) digits is 80640, while the sum is 35.
Adding to 220122043304705 its reverse (507403340221022), we get a palindrome (727525383525727).
The spelling of 220122043304705 in words is "two hundred twenty trillion, one hundred twenty-two billion, forty-three million, three hundred four thousand, seven hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •