Base | Representation |
---|---|
bin | 10001110010000101000… |
… | …111011001101101110100 |
3 | 11022211012120011020210010 |
4 | 101302011013121231310 |
5 | 130010131012202012 |
6 | 2333214135100220 |
7 | 154200253543035 |
oct | 21620507315564 |
9 | 4284176136703 |
10 | 1222004022132 |
11 | 43128145a653 |
12 | 1789ba811670 |
13 | 8b30821764a |
14 | 43206a34a8c |
15 | 21bc1860c3c |
hex | 11c851d9b74 |
1222004022132 has 12 divisors (see below), whose sum is σ = 2851342718336. Its totient is φ = 407334674040.
The previous prime is 1222004022091. The next prime is 1222004022137. The reversal of 1222004022132 is 2312204002221.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 1222004022099 and 1222004022108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1222004022137) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 50916834244 + ... + 50916834267.
Almost surely, 21222004022132 is an apocalyptic number.
1222004022132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1222004022132 is an abundant number, since it is smaller than the sum of its proper divisors (1629338696204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1222004022132 is a wasteful number, since it uses less digits than its factorization.
1222004022132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 101833668518 (or 101833668516 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 1222004022132 its reverse (2312204002221), we get a palindrome (3534208024353).
The spelling of 1222004022132 in words is "one trillion, two hundred twenty-two billion, four million, twenty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •