Base | Representation |
---|---|
bin | 1100110110000010011… |
… | …1001010101001010010 |
3 | 210002120110122102101110 |
4 | 3031200213022221102 |
5 | 12103410014241200 |
6 | 245212143514150 |
7 | 21641156566122 |
oct | 3154047125122 |
9 | 702513572343 |
10 | 220664212050 |
11 | 856462165a7 |
12 | 36923bb8956 |
13 | 17a684b5899 |
14 | a9746a6c82 |
15 | 5b17693b50 |
hex | 33609caa52 |
220664212050 has 24 divisors (see below), whose sum is σ = 547247246256. Its totient is φ = 58843789840.
The previous prime is 220664212009. The next prime is 220664212057. The reversal of 220664212050 is 50212466022.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 220664211999 and 220664212017.
It is not an unprimeable number, because it can be changed into a prime (220664212057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 735547224 + ... + 735547523.
It is an arithmetic number, because the mean of its divisors is an integer number (22801968594).
Almost surely, 2220664212050 is an apocalyptic number.
220664212050 is an abundant number, since it is smaller than the sum of its proper divisors (326583034206).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220664212050 is a wasteful number, since it uses less digits than its factorization.
220664212050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1471094762 (or 1471094757 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 30.
Adding to 220664212050 its reverse (50212466022), we get a palindrome (270876678072).
The spelling of 220664212050 in words is "two hundred twenty billion, six hundred sixty-four million, two hundred twelve thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •