Base | Representation |
---|---|
bin | 1100110011101001010… |
… | …1010111000100010011 |
3 | 210000220201020011222012 |
4 | 3030322111113010103 |
5 | 12101101113311011 |
6 | 245024323133135 |
7 | 21616231141250 |
oct | 3147225270423 |
9 | 700821204865 |
10 | 220022010131 |
11 | 85346763810 |
12 | 36784b141ab |
13 | 17995432151 |
14 | a913296427 |
15 | 5acb0dba8b |
hex | 333a557113 |
220022010131 has 16 divisors (see below), whose sum is σ = 281003724288. Its totient is φ = 167264116800.
The previous prime is 220022010097. The next prime is 220022010149. The reversal of 220022010131 is 131010220022.
It is a happy number.
220022010131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 220022010131 - 222 = 220017815827 is a prime.
It is a super-2 number, since 2×2200220101312 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (220022010161) 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 15 ways as a sum of consecutive naturals, for example, 34843535 + ... + 34849848.
It is an arithmetic number, because the mean of its divisors is an integer number (17562732768).
Almost surely, 2220022010131 is an apocalyptic number.
220022010131 is a deficient number, since it is larger than the sum of its proper divisors (60981714157).
220022010131 is a wasteful number, since it uses less digits than its factorization.
220022010131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69693442.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 220022010131 its reverse (131010220022), we get a palindrome (351032230153).
The spelling of 220022010131 in words is "two hundred twenty billion, twenty-two million, ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •