Base | Representation |
---|---|
bin | 1100110100000000101… |
… | …1111110011101010010 |
3 | 210001011120000102102201 |
4 | 3031000023332131102 |
5 | 12101301233311310 |
6 | 245042152033414 |
7 | 21621532641043 |
oct | 3150013763522 |
9 | 701146012381 |
10 | 220120213330 |
11 | 85397138286 |
12 | 367b199286a |
13 | 179ac896b54 |
14 | a92233a8ca |
15 | 5ad4a38e3a |
hex | 33402fe752 |
220120213330 has 8 divisors (see below), whose sum is σ = 396216384012. Its totient is φ = 88048085328.
The previous prime is 220120213319. The next prime is 220120213337. The reversal of 220120213330 is 33312021022.
220120213330 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 187010407809 + 33109805521 = 432447^2 + 181961^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 220120213298 and 220120213307.
It is not an unprimeable number, because it can be changed into a prime (220120213337) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11006010657 + ... + 11006010676.
Almost surely, 2220120213330 is an apocalyptic number.
220120213330 is a deficient number, since it is larger than the sum of its proper divisors (176096170682).
220120213330 is a wasteful number, since it uses less digits than its factorization.
220120213330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22012021340.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 220120213330 its reverse (33312021022), we get a palindrome (253432234352).
The spelling of 220120213330 in words is "two hundred twenty billion, one hundred twenty million, two hundred thirteen thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •