Base | Representation |
---|---|
bin | 1010001111011101… |
… | …1111101101010000 |
3 | 21002121011120001111 |
4 | 2203313133231100 |
5 | 21112300442000 |
6 | 1132445343104 |
7 | 125062050322 |
oct | 24367375520 |
9 | 7077146044 |
10 | 2749234000 |
11 | 1190964217 |
12 | 648867a94 |
13 | 34a7642a6 |
14 | 1c11ab612 |
15 | 11155ccba |
hex | a3ddfb50 |
2749234000 has 40 divisors (see below), whose sum is σ = 6647652648. Its totient is φ = 1099692800.
The previous prime is 2749233997. The next prime is 2749234009. The reversal of 2749234000 is 4329472.
It can be written as a sum of positive squares in 4 ways, for example, as 286692624 + 2462541376 = 16932^2 + 49624^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2749234009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 685309 + ... + 689308.
Almost surely, 22749234000 is an apocalyptic number.
2749234000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2749234000 is an abundant number, since it is smaller than the sum of its proper divisors (3898418648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2749234000 is a wasteful number, since it uses less digits than its factorization.
2749234000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1374640 (or 1374624 counting only the distinct ones).
The product of its (nonzero) digits is 12096, while the sum is 31.
The square root of 2749234000 is about 52433.1383764123. The cubic root of 2749234000 is about 1400.8895706947.
The spelling of 2749234000 in words is "two billion, seven hundred forty-nine million, two hundred thirty-four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •