Base | Representation |
---|---|
bin | 1010000100110011… |
… | …1001011011100100 |
3 | 20222111000111000112 |
4 | 2201030321123210 |
5 | 21014323401430 |
6 | 1124211032152 |
7 | 124006656536 |
oct | 24114713344 |
9 | 6874014015 |
10 | 2704512740 |
11 | 11686994a6 |
12 | 63589b658 |
13 | 3414067c7 |
14 | 1b9289856 |
15 | 10c677195 |
hex | a13396e4 |
2704512740 has 48 divisors (see below), whose sum is σ = 5930366400. Its totient is φ = 1034716032.
The previous prime is 2704512739. The next prime is 2704512751. The reversal of 2704512740 is 472154072.
It is a junction number, because it is equal to n+sod(n) for n = 2704512697 and 2704512706.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 40271 + ... + 83849.
It is an arithmetic number, because the mean of its divisors is an integer number (123549300).
Almost surely, 22704512740 is an apocalyptic number.
2704512740 is a gapful number since it is divisible by the number (20) 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 2704512740, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2965183200).
2704512740 is an abundant number, since it is smaller than the sum of its proper divisors (3225853660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2704512740 is a wasteful number, since it uses less digits than its factorization.
2704512740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43724 (or 43722 counting only the distinct ones).
The product of its (nonzero) digits is 15680, while the sum is 32.
The square root of 2704512740 is about 52004.9299586107. The cubic root of 2704512740 is about 1393.2520065523.
The spelling of 2704512740 in words is "two billion, seven hundred four million, five hundred twelve thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •