Base | Representation |
---|---|
bin | 1000010110001101… |
… | …0111101111100100 |
3 | 12210011011102000111 |
4 | 2011203113233210 |
5 | 14042101021040 |
6 | 1010200422404 |
7 | 106345100011 |
oct | 20543275744 |
9 | 5704142014 |
10 | 2240642020 |
11 | a4a869571 |
12 | 526477a04 |
13 | 2992914a6 |
14 | 17381a708 |
15 | d1a98dea |
hex | 858d7be4 |
2240642020 has 24 divisors (see below), whose sum is σ = 4706259768. Its totient is φ = 896083200.
The previous prime is 2240642009. The next prime is 2240642059. The reversal of 2240642020 is 202460422.
It can be written as a sum of positive squares in 4 ways, for example, as 1296432036 + 944209984 = 36006^2 + 30728^2 .
It is a junction number, because it is equal to n+sod(n) for n = 2240641982 and 2240642000.
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 7 ways as a sum of consecutive naturals, for example, 162600 + ... + 175840.
It is an arithmetic number, because the mean of its divisors is an integer number (196094157).
Almost surely, 22240642020 is an apocalyptic number.
2240642020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2240642020 is an abundant number, since it is smaller than the sum of its proper divisors (2465617748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2240642020 is a wasteful number, since it uses less digits than its factorization.
2240642020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21711 (or 21709 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 22.
The square root of 2240642020 is about 47335.4203530506. The cubic root of 2240642020 is about 1308.5515174912.
The spelling of 2240642020 in words is "two billion, two hundred forty million, six hundred forty-two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •