Base | Representation |
---|---|
bin | 110010000100110011000011… |
… | …010101110001000111011101 |
3 | 1001212202222100011021200222121 |
4 | 302010303003111301013131 |
5 | 212331240134201124041 |
6 | 2100221105440342541 |
7 | 64250144524541134 |
oct | 6204630325610735 |
9 | 1055688304250877 |
10 | 220232020333021 |
11 | 6419996a04a724 |
12 | 2084a536014a51 |
13 | 95b6a376a00a8 |
14 | 3c5540283a91b |
15 | 1a6db185507d1 |
hex | c84cc35711dd |
220232020333021 has 32 divisors (see below), whose sum is σ = 223072911626240. Its totient is φ = 217411526255616.
The previous prime is 220232020333019. The next prime is 220232020333037. The reversal of 220232020333021 is 120333020232022.
It is a cyclic number.
It is not a de Polignac number, because 220232020333021 - 21 = 220232020333019 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220232020333121) 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 31 ways as a sum of consecutive naturals, for example, 81356489350 + ... + 81356492056.
It is an arithmetic number, because the mean of its divisors is an integer number (6971028488320).
Almost surely, 2220232020333021 is an apocalyptic number.
It is an amenable number.
220232020333021 is a deficient number, since it is larger than the sum of its proper divisors (2840891293219).
220232020333021 is a wasteful number, since it uses less digits than its factorization.
220232020333021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6293.
The product of its (nonzero) digits is 5184, while the sum is 25.
Adding to 220232020333021 its reverse (120333020232022), we get a palindrome (340565040565043).
The spelling of 220232020333021 in words is "two hundred twenty trillion, two hundred thirty-two billion, twenty million, three hundred thirty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.137 sec. • engine limits •