Base | Representation |
---|---|
bin | 1010001101110000… |
… | …0110010001010100 |
3 | 21002002122200002200 |
4 | 2203130012101110 |
5 | 21103431130144 |
6 | 1132031404500 |
7 | 124644025323 |
oct | 24334062124 |
9 | 7062580080 |
10 | 2742051924 |
11 | 11878a9217 |
12 | 646383730 |
13 | 34911b241 |
14 | 1c025c0ba |
15 | 110adec69 |
hex | a3706454 |
2742051924 has 72 divisors (see below), whose sum is σ = 7353335808. Its totient is φ = 858574080.
The previous prime is 2742051913. The next prime is 2742051971. The reversal of 2742051924 is 4291502472.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 330669 + ... + 338859.
It is an arithmetic number, because the mean of its divisors is an integer number (102129664).
Almost surely, 22742051924 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2742051924, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3676667904).
2742051924 is an abundant number, since it is smaller than the sum of its proper divisors (4611283884).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2742051924 is a wasteful number, since it uses less digits than its factorization.
2742051924 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8765 (or 8760 counting only the distinct ones).
The product of its (nonzero) digits is 40320, while the sum is 36.
The square root of 2742051924 is about 52364.6056415973. The cubic root of 2742051924 is about 1399.6686161245.
The spelling of 2742051924 in words is "two billion, seven hundred forty-two million, fifty-one thousand, nine hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •