Base | Representation |
---|---|
bin | 1111000110011100… |
… | …0000100111111001 |
3 | 101110111102220222021 |
4 | 3301213000213321 |
5 | 31300201111400 |
6 | 1510121154441 |
7 | 202310323645 |
oct | 36147004771 |
9 | 11414386867 |
10 | 4053535225 |
11 | 17a012a013 |
12 | 95162ba21 |
13 | 4c7a46c6c |
14 | 2a64cbc25 |
15 | 18acec71a |
hex | f19c09f9 |
4053535225 has 6 divisors (see below), whose sum is σ = 5026383710. Its totient is φ = 3242828160.
The previous prime is 4053535193. The next prime is 4053535229. The reversal of 4053535225 is 5225353504.
It can be written as a sum of positive squares in 3 ways, for example, as 20142144 + 4033393081 = 4488^2 + 63509^2 .
It is not a de Polignac number, because 4053535225 - 25 = 4053535193 is a prime.
It is a super-2 number, since 2×40535352252 = 32862295640631601250, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (4053535229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 81070680 + ... + 81070729.
Almost surely, 24053535225 is an apocalyptic number.
It is an amenable number.
4053535225 is a deficient number, since it is larger than the sum of its proper divisors (972848485).
4053535225 is a wasteful number, since it uses less digits than its factorization.
4053535225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162141419 (or 162141414 counting only the distinct ones).
The product of its (nonzero) digits is 90000, while the sum is 34.
The square root of 4053535225 is about 63667.3795989752. The cubic root of 4053535225 is about 1594.4515136000.
Adding to 4053535225 its reverse (5225353504), we get a palindrome (9278888729).
The spelling of 4053535225 in words is "four billion, fifty-three million, five hundred thirty-five thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •