Base | Representation |
---|---|
bin | 1111000110010110… |
… | …0011000111100000 |
3 | 101110110201110121001 |
4 | 3301211203013200 |
5 | 31300101332344 |
6 | 1510105041344 |
7 | 202304140222 |
oct | 36145430740 |
9 | 11413643531 |
10 | 4053152224 |
11 | 179a998290 |
12 | 951486254 |
13 | 4c7941834 |
14 | 2a642c412 |
15 | 18ac73ed4 |
hex | f19631e0 |
4053152224 has 48 divisors (see below), whose sum is σ = 8712794160. Its totient is φ = 1840706560.
The previous prime is 4053152177. The next prime is 4053152249. The reversal of 4053152224 is 4222513504.
It is a super-2 number, since 2×40531522242 = 32856085901832292352, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4053152192 and 4053152201.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 449262 + ... + 458194.
It is an arithmetic number, because the mean of its divisors is an integer number (181516545).
Almost surely, 24053152224 is an apocalyptic number.
4053152224 is a gapful number since it is divisible by the number (44) formed by its first and last digit.
It is an amenable number.
4053152224 is an abundant number, since it is smaller than the sum of its proper divisors (4659641936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4053152224 is a wasteful number, since it uses less digits than its factorization.
4053152224 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10243 (or 10235 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 28.
The square root of 4053152224 is about 63664.3717003474. The cubic root of 4053152224 is about 1594.4012944106.
Adding to 4053152224 its reverse (4222513504), we get a palindrome (8275665728).
The spelling of 4053152224 in words is "four billion, fifty-three million, one hundred fifty-two thousand, two hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •