Base | Representation |
---|---|
bin | 1000010110000101… |
… | …1000100011110100 |
3 | 12210010011221102021 |
4 | 2011201120203310 |
5 | 14041432333301 |
6 | 1010141322524 |
7 | 106340500144 |
oct | 20541304364 |
9 | 5703157367 |
10 | 2240121076 |
11 | a4a543136 |
12 | 526266444 |
13 | 29913b33b |
14 | 173722924 |
15 | d19e48a1 |
hex | 858588f4 |
2240121076 has 36 divisors (see below), whose sum is σ = 4178197548. Its totient is φ = 1050677248.
The previous prime is 2240121073. The next prime is 2240121119. The reversal of 2240121076 is 6701210422.
It can be written as a sum of positive squares in 6 ways, for example, as 5290000 + 2234831076 = 2300^2 + 47274^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 2240121076.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2240121073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 363396 + ... + 369508.
It is an arithmetic number, because the mean of its divisors is an integer number (116061043).
Almost surely, 22240121076 is an apocalyptic number.
It is an amenable number.
2240121076 is a deficient number, since it is larger than the sum of its proper divisors (1938076472).
2240121076 is a wasteful number, since it uses less digits than its factorization.
2240121076 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6468 (or 6449 counting only the distinct ones).
The product of its (nonzero) digits is 1344, while the sum is 25.
The square root of 2240121076 is about 47329.9173462198. The cubic root of 2240121076 is about 1308.4500979141.
Adding to 2240121076 its reverse (6701210422), we get a palindrome (8941331498).
The spelling of 2240121076 in words is "two billion, two hundred forty million, one hundred twenty-one thousand, seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •