Base | Representation |
---|---|
bin | 1000010110001101… |
… | …0011000000100100 |
3 | 12210011010102102021 |
4 | 2011203103000210 |
5 | 14042044411003 |
6 | 1010200152524 |
7 | 106344656326 |
oct | 20543230044 |
9 | 5704112367 |
10 | 2240622628 |
11 | a4a855a42 |
12 | 526468744 |
13 | 29928570a |
14 | 173813616 |
15 | d1a932bd |
hex | 858d3024 |
2240622628 has 12 divisors (see below), whose sum is σ = 3925263132. Its totient is φ = 1119118880.
The previous prime is 2240622623. The next prime is 2240622641. The reversal of 2240622628 is 8262260422.
It can be written as a sum of positive squares in 2 ways, for example, as 744634944 + 1495987684 = 27288^2 + 38678^2 .
It is a super-2 number, since 2×22406226282 = 10040779522211252768, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2240622593 and 2240622602.
It is not an unprimeable number, because it can be changed into a prime (2240622623) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 293875 + ... + 301402.
It is an arithmetic number, because the mean of its divisors is an integer number (327105261).
Almost surely, 22240622628 is an apocalyptic number.
It is an amenable number.
2240622628 is a deficient number, since it is larger than the sum of its proper divisors (1684640504).
2240622628 is a wasteful number, since it uses less digits than its factorization.
2240622628 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 596222 (or 596220 counting only the distinct ones).
The product of its (nonzero) digits is 36864, while the sum is 34.
The square root of 2240622628 is about 47335.2155165686. The cubic root of 2240622628 is about 1308.5477424565.
The spelling of 2240622628 in words is "two billion, two hundred forty million, six hundred twenty-two thousand, six hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •