Base | Representation |
---|---|
bin | 1010000001001110011010… |
… | …10010000000010000101000 |
3 | 2220000021022001101002021012 |
4 | 11000213031102000100220 |
5 | 10341434203303410440 |
6 | 114505302511203052 |
7 | 4432532465103215 |
oct | 500471522002050 |
9 | 86007261332235 |
10 | 22032331310120 |
11 | 702494a70872a |
12 | 257a01b216488 |
13 | c3a841bc8731 |
14 | 562528a14b0c |
15 | 2831a1495e65 |
hex | 1409cd480428 |
22032331310120 has 16 divisors (see below), whose sum is σ = 49572745447860. Its totient is φ = 8812932524032.
The previous prime is 22032331310089. The next prime is 22032331310131. The reversal of 22032331310120 is 2101313323022.
It can be written as a sum of positive squares in 2 ways, for example, as 21943659572836 + 88671737284 = 4684406^2 + 297778^2 .
It is a super-2 number, since 2×220323313101202 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 275404141337 + ... + 275404141416.
Almost surely, 222032331310120 is an apocalyptic number.
22032331310120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
22032331310120 is an abundant number, since it is smaller than the sum of its proper divisors (27540414137740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22032331310120 is a wasteful number, since it uses less digits than its factorization.
22032331310120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 550808282764 (or 550808282760 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 22032331310120 its reverse (2101313323022), we get a palindrome (24133644633142).
The spelling of 22032331310120 in words is "twenty-two trillion, thirty-two billion, three hundred thirty-one million, three hundred ten thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •