Base | Representation |
---|---|
bin | 1010001111001100… |
… | …0011100100111110 |
3 | 21002111222102122000 |
4 | 2203303003210332 |
5 | 21112001221311 |
6 | 1132404403130 |
7 | 125046132330 |
oct | 24363034476 |
9 | 7074872560 |
10 | 2748070206 |
11 | 1190239902 |
12 | 6483a64a6 |
13 | 34a44765b |
14 | 1c0d87450 |
15 | 1113cd056 |
hex | a3cc393e |
2748070206 has 128 divisors (see below), whose sum is σ = 7584153600. Its totient is φ = 719785440.
The previous prime is 2748070183. The next prime is 2748070211. The reversal of 2748070206 is 6020708472.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 216471 + ... + 228813.
It is an arithmetic number, because the mean of its divisors is an integer number (59251200).
Almost surely, 22748070206 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2748070206, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3792076800).
2748070206 is an abundant number, since it is smaller than the sum of its proper divisors (4836083394).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2748070206 is a wasteful number, since it uses less digits than its factorization.
2748070206 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12411 (or 12405 counting only the distinct ones).
The product of its (nonzero) digits is 37632, while the sum is 36.
The square root of 2748070206 is about 52422.0393155398. The cubic root of 2748070206 is about 1400.6918699313.
Adding to 2748070206 its reverse (6020708472), we get a palindrome (8768778678).
The spelling of 2748070206 in words is "two billion, seven hundred forty-eight million, seventy thousand, two hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •