Base | Representation |
---|---|
bin | 1111000110001000… |
… | …0101101000001001 |
3 | 101110102000101010012 |
4 | 3301202011220021 |
5 | 31244333320001 |
6 | 1510033401305 |
7 | 202263341240 |
oct | 36142055011 |
9 | 11412011105 |
10 | 4052245001 |
11 | 179a428712 |
12 | 951109235 |
13 | 4c76b490c |
14 | 2a6273957 |
15 | 18ab452bb |
hex | f1885a09 |
4052245001 has 12 divisors (see below), whose sum is σ = 4919584128. Its totient is φ = 3269036352.
The previous prime is 4052244971. The next prime is 4052245031. The reversal of 4052245001 is 1005422504.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (4052244971) and next prime (4052245031).
It is not a de Polignac number, because 4052245001 - 210 = 4052243977 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4052245031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 999521 + ... + 1003566.
It is an arithmetic number, because the mean of its divisors is an integer number (409965344).
Almost surely, 24052245001 is an apocalyptic number.
It is an amenable number.
4052245001 is a deficient number, since it is larger than the sum of its proper divisors (867339127).
4052245001 is a wasteful number, since it uses less digits than its factorization.
4052245001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2003128 (or 2003111 counting only the distinct ones).
The product of its (nonzero) digits is 1600, while the sum is 23.
The square root of 4052245001 is about 63657.2462568088. The cubic root of 4052245001 is about 1594.2823264748.
Adding to 4052245001 its reverse (1005422504), we get a palindrome (5057667505).
The spelling of 4052245001 in words is "four billion, fifty-two million, two hundred forty-five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •