Base | Representation |
---|---|
bin | 100000010011101001100… |
… | …001111100001011101100 |
3 | 21212020112001112222221220 |
4 | 200103221201330023230 |
5 | 242333302001111244 |
6 | 4415524244223340 |
7 | 316253446045032 |
oct | 40235141741354 |
9 | 7766461488856 |
10 | 2220121113324 |
11 | 786603543264 |
12 | 2ba33609ab50 |
13 | 131483384a5a |
14 | 79650d82552 |
15 | 3cb3cb43319 |
hex | 204e987c2ec |
2220121113324 has 24 divisors (see below), whose sum is σ = 5184953758320. Its totient is φ = 739373062464.
The previous prime is 2220121113323. The next prime is 2220121113341. The reversal of 2220121113324 is 4233111210222.
It is a junction number, because it is equal to n+sod(n) for n = 2220121113294 and 2220121113303.
It is not an unprimeable number, because it can be changed into a prime (2220121113323) 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, 83399719 + ... + 83426334.
It is an arithmetic number, because the mean of its divisors is an integer number (216039739930).
Almost surely, 22220121113324 is an apocalyptic number.
It is an amenable number.
2220121113324 is an abundant number, since it is smaller than the sum of its proper divisors (2964832644996).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2220121113324 is a wasteful number, since it uses less digits than its factorization.
2220121113324 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 166827169 (or 166827167 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 2220121113324 its reverse (4233111210222), we get a palindrome (6453232323546).
The spelling of 2220121113324 in words is "two trillion, two hundred twenty billion, one hundred twenty-one million, one hundred thirteen thousand, three hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •