Base | Representation |
---|---|
bin | 1100000110100011… |
… | …1011000000000000 |
3 | 22101102001120220111 |
4 | 3001220323000000 |
5 | 23123133330422 |
6 | 1254211321104 |
7 | 143335515235 |
oct | 30150730000 |
9 | 8342046814 |
10 | 3248730112 |
11 | 1417907021 |
12 | 767bb0194 |
13 | 3ca0a0c14 |
14 | 22b67178c |
15 | 140326a77 |
hex | c1a3b000 |
3248730112 has 52 divisors (see below), whose sum is σ = 6555093480. Its totient is φ = 1609760768.
The previous prime is 3248730049. The next prime is 3248730113. The reversal of 3248730112 is 2110378423.
It is not an unprimeable number, because it can be changed into a prime (3248730113) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 459339 + ... + 466357.
It is an arithmetic number, because the mean of its divisors is an integer number (126059490).
Almost surely, 23248730112 is an apocalyptic number.
3248730112 is a gapful number since it is divisible by the number (32) 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 3248730112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3277546740).
3248730112 is an abundant number, since it is smaller than the sum of its proper divisors (3306363368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3248730112 is an equidigital number, since it uses as much as digits as its factorization.
3248730112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7156 (or 7134 counting only the distinct ones).
The product of its (nonzero) digits is 8064, while the sum is 31.
The square root of 3248730112 is about 56997.6325122369. The cubic root of 3248730112 is about 1481.0550840345.
The spelling of 3248730112 in words is "three billion, two hundred forty-eight million, seven hundred thirty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •