Base | Representation |
---|---|
bin | 1011001000000000100100… |
… | …1000111101000000111110 |
3 | 1121022101111110100120220110 |
4 | 2302000021020331000332 |
5 | 3100403041332413042 |
6 | 42003223202530450 |
7 | 2401514551111443 |
oct | 262001110750076 |
9 | 47271443316813 |
10 | 12232220201022 |
11 | 3996723456a08 |
12 | 1456829966a26 |
13 | 6a9655059263 |
14 | 304084d239ca |
15 | 1632c4d7b09c |
hex | b200923d03e |
12232220201022 has 32 divisors (see below), whose sum is σ = 27029765359872. Its totient is φ = 3670708874624.
The previous prime is 12232220200997. The next prime is 12232220201053. The reversal of 12232220201022 is 22010202223221.
It is a super-2 number, since 2×122322202010222 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12232220201022.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 2607035208 + ... + 2607039899.
It is an arithmetic number, because the mean of its divisors is an integer number (844680167496).
Almost surely, 212232220201022 is an apocalyptic number.
12232220201022 is an abundant number, since it is smaller than the sum of its proper divisors (14797545158850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12232220201022 is a wasteful number, since it uses less digits than its factorization.
12232220201022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5214075152.
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 12232220201022 its reverse (22010202223221), we get a palindrome (34242422424243).
The spelling of 12232220201022 in words is "twelve trillion, two hundred thirty-two billion, two hundred twenty million, two hundred one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •