Base | Representation |
---|---|
bin | 1010000101000110… |
… | …0111011111000100 |
3 | 20222120100100011100 |
4 | 2201101213133010 |
5 | 21020132444311 |
6 | 1124253340100 |
7 | 124023331560 |
oct | 24121473704 |
9 | 6876310140 |
10 | 2705749956 |
11 | 1169363a98 |
12 | 636197630 |
13 | 34174a9a0 |
14 | 1b94cc6a0 |
15 | 10c81da56 |
hex | a14677c4 |
2705749956 has 144 divisors (see below), whose sum is σ = 8597481984. Its totient is φ = 698381568.
The previous prime is 2705749939. The next prime is 2705749957. The reversal of 2705749956 is 6599475072.
It is not an unprimeable number, because it can be changed into a prime (2705749957) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 145186 + ... + 162758.
It is an arithmetic number, because the mean of its divisors is an integer number (59704736).
Almost surely, 22705749956 is an apocalyptic number.
2705749956 is a gapful number since it is divisible by the number (26) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2705749956, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4298740992).
2705749956 is an abundant number, since it is smaller than the sum of its proper divisors (5891732028).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2705749956 is a wasteful number, since it uses less digits than its factorization.
2705749956 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17650 (or 17645 counting only the distinct ones).
The product of its (nonzero) digits is 4762800, while the sum is 54.
The square root of 2705749956 is about 52016.8237784661. The cubic root of 2705749956 is about 1393.4644281670.
The spelling of 2705749956 in words is "two billion, seven hundred five million, seven hundred forty-nine thousand, nine hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •