Base | Representation |
---|---|
bin | 1000001000110000… |
… | …00111011000000000 |
3 | 102021102220121021000 |
4 | 10010120013120000 |
5 | 32421302212244 |
6 | 2001245532000 |
7 | 213152524500 |
oct | 40430073000 |
9 | 12242817230 |
10 | 4368397824 |
11 | 1941934a3a |
12 | a1ab74000 |
13 | 5480499ab |
14 | 2d624da00 |
15 | 1a8795169 |
hex | 104607600 |
4368397824 has 240 divisors, whose sum is σ = 15044238000. Its totient is φ = 1247920128.
The previous prime is 4368397811. The next prime is 4368397841. The reversal of 4368397824 is 4287938634.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a nude number because it is divisible by every one of its digits.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 674152 + ... + 680600.
It is an arithmetic number, because the mean of its divisors is an integer number (62684325).
Almost surely, 24368397824 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 4368397824, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7522119000).
4368397824 is an abundant number, since it is smaller than the sum of its proper divisors (10675840176).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4368397824 is an equidigital number, since it uses as much as digits as its factorization.
4368397824 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6490 (or 6461 counting only the distinct ones).
The product of its digits is 6967296, while the sum is 54.
The square root of 4368397824 is about 66093.8561743828. The cubic root of 4368397824 is about 1634.7100302194.
The spelling of 4368397824 in words is "four billion, three hundred sixty-eight million, three hundred ninety-seven thousand, eight hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •