Base | Representation |
---|---|
bin | 1111000101101101… |
… | …1100111000001001 |
3 | 101110021201222121001 |
4 | 3301123130320021 |
5 | 31243412131400 |
6 | 1505532215001 |
7 | 202242504064 |
oct | 36133347011 |
9 | 11407658531 |
10 | 4050505225 |
11 | 179944a588 |
12 | 95060a461 |
13 | 4c7225a70 |
14 | 2a5d3d8db |
15 | 18a8eea6a |
hex | f16dce09 |
4050505225 has 48 divisors (see below), whose sum is σ = 5534114544. Its totient is φ = 2922624000.
The previous prime is 4050505219. The next prime is 4050505247. The reversal of 4050505225 is 5225050504.
It can be written as a sum of positive squares in 24 ways, for example, as 2633434489 + 1417070736 = 51317^2 + 37644^2 .
It is not a de Polignac number, because 4050505225 - 27 = 4050505097 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4050505193 and 4050505202.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 3429135 + ... + 3430315.
It is an arithmetic number, because the mean of its divisors is an integer number (115294053).
Almost surely, 24050505225 is an apocalyptic number.
It is an amenable number.
4050505225 is a deficient number, since it is larger than the sum of its proper divisors (1483609319).
4050505225 is a wasteful number, since it uses less digits than its factorization.
4050505225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1438 (or 1433 counting only the distinct ones).
The product of its (nonzero) digits is 10000, while the sum is 28.
The square root of 4050505225 is about 63643.5796054873. The cubic root of 4050505225 is about 1594.0541327063.
Adding to 4050505225 its reverse (5225050504), we get a palindrome (9275555729).
The spelling of 4050505225 in words is "four billion, fifty million, five hundred five thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •