Base | Representation |
---|---|
bin | 1011010100110101… |
… | …1010011101000000 |
3 | 21211212122202211120 |
4 | 2311031122131000 |
5 | 22211242123240 |
6 | 1221401512240 |
7 | 135224131314 |
oct | 26515323500 |
9 | 7755582746 |
10 | 3040192320 |
11 | 1320122540 |
12 | 70a1a2680 |
13 | 395b17789 |
14 | 20baa9b44 |
15 | 12bd82ad0 |
hex | b535a740 |
3040192320 has 448 divisors, whose sum is σ = 11208056832. Its totient is φ = 691200000.
The previous prime is 3040192303. The next prime is 3040192339. The reversal of 3040192320 is 232910403.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 12112195 + ... + 12112445.
It is an arithmetic number, because the mean of its divisors is an integer number (25017984).
Almost surely, 23040192320 is an apocalyptic number.
3040192320 is a gapful number since it is divisible by the number (30) 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 3040192320, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5604028416).
3040192320 is an abundant number, since it is smaller than the sum of its proper divisors (8167864512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3040192320 is a wasteful number, since it uses less digits than its factorization.
3040192320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 350 (or 340 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 24.
The square root of 3040192320 is about 55137.9390256836. The cubic root of 3040192320 is about 1448.6618363742.
The spelling of 3040192320 in words is "three billion, forty million, one hundred ninety-two thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •