Base | Representation |
---|---|
bin | 1111011000010010… |
… | …1111010101000000 |
3 | 101122201101100200010 |
4 | 3312010233111000 |
5 | 31423340000233 |
6 | 1521354424520 |
7 | 204210066063 |
oct | 36604572500 |
9 | 11581340603 |
10 | 4128437568 |
11 | 1829439282 |
12 | 972732140 |
13 | 50a410c88 |
14 | 2b24288da |
15 | 192695b63 |
hex | f612f540 |
4128437568 has 112 divisors (see below), whose sum is σ = 11336219136. Its totient is φ = 1325022720.
The previous prime is 4128437549. The next prime is 4128437569. The reversal of 4128437568 is 8657348214.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4128437569) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 582655 + ... + 589697.
Almost surely, 24128437568 is an apocalyptic number.
4128437568 is a gapful number since it is divisible by the number (48) 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 4128437568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5668109568).
4128437568 is an abundant number, since it is smaller than the sum of its proper divisors (7207781568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4128437568 is a wasteful number, since it uses less digits than its factorization.
4128437568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7172 (or 7162 counting only the distinct ones).
The product of its digits is 1290240, while the sum is 48.
The square root of 4128437568 is about 64252.9187508241. The cubic root of 4128437568 is about 1604.2125409946.
The spelling of 4128437568 in words is "four billion, one hundred twenty-eight million, four hundred thirty-seven thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •