Base | Representation |
---|---|
bin | 1010010011000010… |
… | …1111110011011100 |
3 | 21010122102001100112 |
4 | 2210300233303130 |
5 | 21130121222030 |
6 | 1134143145152 |
7 | 125333445662 |
oct | 24460576334 |
9 | 7118361315 |
10 | 2764242140 |
11 | 1199385040 |
12 | 6518a51b8 |
13 | 3508ba54a |
14 | 1c3196c32 |
15 | 112a24a95 |
hex | a4c2fcdc |
2764242140 has 48 divisors (see below), whose sum is σ = 6487102944. Its totient is φ = 980659200.
The previous prime is 2764242133. The next prime is 2764242149. The reversal of 2764242140 is 412424672.
It is a junction number, because it is equal to n+sod(n) for n = 2764242097 and 2764242106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2764242149) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 144209 + ... + 162248.
It is an arithmetic number, because the mean of its divisors is an integer number (135147978).
Almost surely, 22764242140 is an apocalyptic number.
2764242140 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2764242140 is an abundant number, since it is smaller than the sum of its proper divisors (3722860804).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2764242140 is a wasteful number, since it uses less digits than its factorization.
2764242140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 306518 (or 306516 counting only the distinct ones).
The product of its (nonzero) digits is 21504, while the sum is 32.
The square root of 2764242140 is about 52576.0605218763. The cubic root of 2764242140 is about 1403.4341102763.
The spelling of 2764242140 in words is "two billion, seven hundred sixty-four million, two hundred forty-two thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •