Base | Representation |
---|---|
bin | 110010000010001110010011… |
… | …110110110001100010110101 |
3 | 1001212011001202100221202100112 |
4 | 302002032103312301202311 |
5 | 212320340401241120041 |
6 | 2100003533043152405 |
7 | 64231313155642652 |
oct | 6202162366614265 |
9 | 1055131670852315 |
10 | 220055130020021 |
11 | 641309470863aa |
12 | 208201a9975705 |
13 | 95a3157095b2a |
14 | 3c4aa21a3ac29 |
15 | 1a69213d55deb |
hex | c82393db18b5 |
220055130020021 has 16 divisors (see below), whose sum is σ = 230356366000128. Its totient is φ = 209954148625200.
The previous prime is 220055130019973. The next prime is 220055130020027. The reversal of 220055130020021 is 120020031550022.
It is a cyclic number.
It is not a de Polignac number, because 220055130020021 - 214 = 220055130003637 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220055130020027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 159340556 + ... + 160715658.
It is an arithmetic number, because the mean of its divisors is an integer number (14397272875008).
Almost surely, 2220055130020021 is an apocalyptic number.
It is an amenable number.
220055130020021 is a deficient number, since it is larger than the sum of its proper divisors (10301235980107).
220055130020021 is a wasteful number, since it uses less digits than its factorization.
220055130020021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1447912.
The product of its (nonzero) digits is 1200, while the sum is 23.
Adding to 220055130020021 its reverse (120020031550022), we get a palindrome (340075161570043).
The spelling of 220055130020021 in words is "two hundred twenty trillion, fifty-five billion, one hundred thirty million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •