Base | Representation |
---|---|
bin | 1100110101100000110… |
… | …1000001111110001011 |
3 | 210002012122012101002201 |
4 | 3031120031001332023 |
5 | 12103112411034201 |
6 | 245150144141031 |
7 | 21634524534211 |
oct | 3153015017613 |
9 | 702178171081 |
10 | 220523143051 |
11 | 85583624352 |
12 | 368a4907777 |
13 | 17a451c2ac3 |
14 | a95da64cb1 |
15 | 5b0a0ca801 |
hex | 3358341f8b |
220523143051 has 4 divisors (see below), whose sum is σ = 220600712952. Its totient is φ = 220445573152.
The previous prime is 220523143037. The next prime is 220523143103. The reversal of 220523143051 is 150341325022.
220523143051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 220523143051 - 213 = 220523134859 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (220523143021) 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, 38780686 + ... + 38786371.
It is an arithmetic number, because the mean of its divisors is an integer number (55150178238).
Almost surely, 2220523143051 is an apocalyptic number.
220523143051 is a deficient number, since it is larger than the sum of its proper divisors (77569901).
220523143051 is an equidigital number, since it uses as much as digits as its factorization.
220523143051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77569900.
The product of its (nonzero) digits is 7200, while the sum is 28.
Adding to 220523143051 its reverse (150341325022), we get a palindrome (370864468073).
The spelling of 220523143051 in words is "two hundred twenty billion, five hundred twenty-three million, one hundred forty-three thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •