Base | Representation |
---|---|
bin | 10001110001010110100… |
… | …000111111011100101100 |
3 | 11022202012002000121222210 |
4 | 101301112200333130230 |
5 | 130002030340414012 |
6 | 2333004410010420 |
7 | 154142011302363 |
oct | 21612640773454 |
9 | 4282162017883 |
10 | 1221222201132 |
11 | 430a1010599a |
12 | 178820a16a10 |
13 | 8b21225b07b |
14 | 43170c7c7da |
15 | 21b77dca23c |
hex | 11c5683f72c |
1221222201132 has 48 divisors (see below), whose sum is σ = 2967751325952. Its totient is φ = 390493575360.
The previous prime is 1221222201131. The next prime is 1221222201137. The reversal of 1221222201132 is 2311022221221.
It is a junction number, because it is equal to n+sod(n) for n = 1221222201099 and 1221222201108.
It is not an unprimeable number, because it can be changed into a prime (1221222201131) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19338198 + ... + 19401245.
It is an arithmetic number, because the mean of its divisors is an integer number (61828152624).
Almost surely, 21221222201132 is an apocalyptic number.
1221222201132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1221222201132 is an abundant number, since it is smaller than the sum of its proper divisors (1746529124820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1221222201132 is a wasteful number, since it uses less digits than its factorization.
1221222201132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38739558 (or 38739556 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 1221222201132 its reverse (2311022221221), we get a palindrome (3532244422353).
The spelling of 1221222201132 in words is "one trillion, two hundred twenty-one billion, two hundred twenty-two million, two hundred one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •