Base | Representation |
---|---|
bin | 100000010011100011110… |
… | …000010010011011001001 |
3 | 21212020021022012212011022 |
4 | 200103203300102123021 |
5 | 242333102144224040 |
6 | 4415510503242225 |
7 | 316251161304266 |
oct | 40234360223311 |
9 | 7766238185138 |
10 | 2220024211145 |
11 | 786563878214 |
12 | 2ba309749375 |
13 | 1314692872a0 |
14 | 7964215a26d |
15 | 3cb343a16b5 |
hex | 204e3c126c9 |
2220024211145 has 32 divisors (see below), whose sum is σ = 2968783211520. Its totient is φ = 1582391704320.
The previous prime is 2220024211133. The next prime is 2220024211157. The reversal of 2220024211145 is 5411124200222.
It is an interprime number because it is at equal distance from previous prime (2220024211133) and next prime (2220024211157).
It is not a de Polignac number, because 2220024211145 - 214 = 2220024194761 is a prime.
It is a super-2 number, since 2×22200242111452 (a number of 25 digits) contains 22 as substring.
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 31 ways as a sum of consecutive naturals, for example, 6102152 + ... + 6455718.
It is an arithmetic number, because the mean of its divisors is an integer number (92774475360).
Almost surely, 22220024211145 is an apocalyptic number.
It is an amenable number.
2220024211145 is a deficient number, since it is larger than the sum of its proper divisors (748759000375).
2220024211145 is a wasteful number, since it uses less digits than its factorization.
2220024211145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 356945.
The product of its (nonzero) digits is 2560, while the sum is 26.
Adding to 2220024211145 its reverse (5411124200222), we get a palindrome (7631148411367).
The spelling of 2220024211145 in words is "two trillion, two hundred twenty billion, twenty-four million, two hundred eleven thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •