Base | Representation |
---|---|
bin | 1010000101000110… |
… | …0101100100011100 |
3 | 20222120022221101200 |
4 | 2201101211210130 |
5 | 21020132221413 |
6 | 1124253235500 |
7 | 124023266646 |
oct | 24121454434 |
9 | 6876287350 |
10 | 2705742108 |
11 | 1169359103 |
12 | 636192b90 |
13 | 341747244 |
14 | 1b94c9896 |
15 | 10c81b573 |
hex | a146591c |
2705742108 has 72 divisors (see below), whose sum is σ = 7191518880. Its totient is φ = 856517760.
The previous prime is 2705742097. The next prime is 2705742131. The reversal of 2705742108 is 8012475072.
2705742108 is a `hidden beast` number, since 2 + 70 + 574 + 2 + 10 + 8 = 666.
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, 42441 + ... + 84927.
Almost surely, 22705742108 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 2705742108, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3595759440).
2705742108 is an abundant number, since it is smaller than the sum of its proper divisors (4485776772).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2705742108 is a wasteful number, since it uses less digits than its factorization.
2705742108 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42587 (or 42582 counting only the distinct ones).
The product of its (nonzero) digits is 31360, while the sum is 36.
The square root of 2705742108 is about 52016.7483412795. The cubic root of 2705742108 is about 1393.4630809226.
The spelling of 2705742108 in words is "two billion, seven hundred five million, seven hundred forty-two thousand, one hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.226 sec. • engine limits •