Base | Representation |
---|---|
bin | 11000100100100100100000 |
3 | 110010020201202 |
4 | 120210210200 |
5 | 3122104443 |
6 | 350020332 |
7 | 105515102 |
oct | 30444440 |
9 | 13106652 |
10 | 6441248 |
11 | 36aa450 |
12 | 21a76a8 |
13 | 1446ab8 |
14 | bd9572 |
15 | 8737b8 |
hex | 624920 |
6441248 has 48 divisors (see below), whose sum is σ = 14333760. Its totient is φ = 2822400.
The previous prime is 6441241. The next prime is 6441257. The reversal of 6441248 is 8421446.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a self number, because there is not a number n which added to its sum of digits gives 6441248.
It is not an unprimeable number, because it can be changed into a prime (6441241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9893 + ... + 10523.
It is an arithmetic number, because the mean of its divisors is an integer number (298620).
Almost surely, 26441248 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 6441248, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7166880).
6441248 is an abundant number, since it is smaller than the sum of its proper divisors (7892512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6441248 is a wasteful number, since it uses less digits than its factorization.
6441248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 681 (or 673 counting only the distinct ones).
The product of its digits is 6144, while the sum is 29.
The square root of 6441248 is about 2537.9613866251. The cubic root of 6441248 is about 186.0615667003.
The spelling of 6441248 in words is "six million, four hundred forty-one thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •