Base | Representation |
---|---|
bin | 1111000101101110… |
… | …1010111111101101 |
3 | 101110021211220220211 |
4 | 3301123222333231 |
5 | 31243421004203 |
6 | 1505533342421 |
7 | 202243134505 |
oct | 36133527755 |
9 | 11407756824 |
10 | 4050563053 |
11 | 1799489a79 |
12 | 950637a11 |
13 | 4c7246194 |
14 | 2a5d56a05 |
15 | 18a911c6d |
hex | f16eafed |
4050563053 has 4 divisors (see below), whose sum is σ = 4116965788. Its totient is φ = 3984160320.
The previous prime is 4050563047. The next prime is 4050563057. The reversal of 4050563053 is 3503650504.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2335112329 + 1715450724 = 48323^2 + 41418^2 .
It is a cyclic number.
It is not a de Polignac number, because 4050563053 - 225 = 4017008621 is a prime.
It is a super-2 number, since 2×40505630532 = 32814122092657361618, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4050563057) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33201276 + ... + 33201397.
It is an arithmetic number, because the mean of its divisors is an integer number (1029241447).
Almost surely, 24050563053 is an apocalyptic number.
It is an amenable number.
4050563053 is a deficient number, since it is larger than the sum of its proper divisors (66402735).
4050563053 is an equidigital number, since it uses as much as digits as its factorization.
4050563053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66402734.
The product of its (nonzero) digits is 27000, while the sum is 31.
The square root of 4050563053 is about 63644.0339152069. The cubic root of 4050563053 is about 1594.0617186344.
The spelling of 4050563053 in words is "four billion, fifty million, five hundred sixty-three thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •