Base | Representation |
---|---|
bin | 1100100011101000… |
… | …00001010010100000 |
3 | 122101210221112122000 |
4 | 12101310001102200 |
5 | 102301233103014 |
6 | 3032533244000 |
7 | 326025051660 |
oct | 62164012240 |
9 | 18353845560 |
10 | 6741300384 |
11 | 294a319835 |
12 | 1381793600 |
13 | 835838850 |
14 | 47d4581a0 |
15 | 296c67509 |
hex | 191d014a0 |
6741300384 has 384 divisors, whose sum is σ = 24385536000. Its totient is φ = 1764301824.
The previous prime is 6741300353. The next prime is 6741300427. The reversal of 6741300384 is 4830031476.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 14073457 + ... + 14073935.
It is an arithmetic number, because the mean of its divisors is an integer number (63504000).
Almost surely, 26741300384 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 6741300384, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12192768000).
6741300384 is an abundant number, since it is smaller than the sum of its proper divisors (17644235616).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6741300384 is a wasteful number, since it uses less digits than its factorization.
6741300384 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 697 (or 683 counting only the distinct ones).
The product of its (nonzero) digits is 48384, while the sum is 36.
The square root of 6741300384 is about 82105.4223787930. The cubic root of 6741300384 is about 1889.0693125024.
The spelling of 6741300384 in words is "six billion, seven hundred forty-one million, three hundred thousand, three hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •