Base | Representation |
---|---|
bin | 1100110011111111000… |
… | …1000000010101011100 |
3 | 210001011001201012221112 |
4 | 3030333301000111130 |
5 | 12101242431040012 |
6 | 245041340321152 |
7 | 21621415563161 |
oct | 3147761002534 |
9 | 701131635845 |
10 | 220113143132 |
11 | 85393149343 |
12 | 367ab5431b8 |
13 | 179ab28c9bc |
14 | a92141a068 |
15 | 5ad40de122 |
hex | 333fc4055c |
220113143132 has 12 divisors (see below), whose sum is σ = 397623742656. Its totient is φ = 106506359520.
The previous prime is 220113143119. The next prime is 220113143137. The reversal of 220113143132 is 231341311022.
220113143132 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 220113143098 and 220113143107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220113143137) 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, 887552873 + ... + 887553120.
It is an arithmetic number, because the mean of its divisors is an integer number (33135311888).
Almost surely, 2220113143132 is an apocalyptic number.
It is an amenable number.
220113143132 is a deficient number, since it is larger than the sum of its proper divisors (177510599524).
220113143132 is a wasteful number, since it uses less digits than its factorization.
220113143132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1775106028 (or 1775106026 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 220113143132 its reverse (231341311022), we get a palindrome (451454454154).
The spelling of 220113143132 in words is "two hundred twenty billion, one hundred thirteen million, one hundred forty-three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •