Base | Representation |
---|---|
bin | 1010000110001100100110… |
… | …00100100101010011010110 |
3 | 2220121121012221021121202021 |
4 | 11003012103010211103112 |
5 | 10402234024232431032 |
6 | 115115553213403354 |
7 | 4451060561000653 |
oct | 503062304452326 |
9 | 86547187247667 |
10 | 22203153405142 |
11 | 7090339297a76 |
12 | 25a715319955a |
13 | c50996270578 |
14 | 56a8d1928c2a |
15 | 28784d080097 |
hex | 1431931254d6 |
22203153405142 has 16 divisors (see below), whose sum is σ = 34224872688720. Its totient is φ = 10795213644768.
The previous prime is 22203153405113. The next prime is 22203153405143. The reversal of 22203153405142 is 24150435130222.
It is a super-2 number, since 2×222031534051422 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22203153405098 and 22203153405107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22203153405143) 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 7 ways as a sum of consecutive naturals, for example, 87656628 + ... + 87909559.
It is an arithmetic number, because the mean of its divisors is an integer number (2139054543045).
Almost surely, 222203153405142 is an apocalyptic number.
22203153405142 is a deficient number, since it is larger than the sum of its proper divisors (12021719283578).
22203153405142 is a wasteful number, since it uses less digits than its factorization.
22203153405142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 175567935.
The product of its (nonzero) digits is 57600, while the sum is 34.
Adding to 22203153405142 its reverse (24150435130222), we get a palindrome (46353588535364).
The spelling of 22203153405142 in words is "twenty-two trillion, two hundred three billion, one hundred fifty-three million, four hundred five thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •