Base | Representation |
---|---|
bin | 1000011001001010… |
… | …01110100111000000 |
3 | 102122000221012201221 |
4 | 10030211032213000 |
5 | 33212022144211 |
6 | 2023044204424 |
7 | 216443550631 |
oct | 41445164700 |
9 | 12560835657 |
10 | 4506053056 |
11 | 1a0260539a |
12 | a59099714 |
13 | 56a7159ab |
14 | 30a643888 |
15 | 1b58d6c71 |
hex | 10c94e9c0 |
4506053056 has 56 divisors (see below), whose sum is σ = 9102486240. Its totient is φ = 2212761600.
The previous prime is 4506053051. The next prime is 4506053077. The reversal of 4506053056 is 6503506054.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4506053051) 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 7 ways as a sum of consecutive naturals, for example, 1275100 + ... + 1278628.
Almost surely, 24506053056 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4506053056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4551243120).
4506053056 is an abundant number, since it is smaller than the sum of its proper divisors (4596433184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4506053056 is a wasteful number, since it uses less digits than its factorization.
4506053056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3893 (or 3883 counting only the distinct ones).
The product of its (nonzero) digits is 54000, while the sum is 34.
The square root of 4506053056 is about 67127.1409788917. The cubic root of 4506053056 is about 1651.7035428061.
It can be divided in two parts, 450 and 6053056, that added together give a palindrome (6053506).
The spelling of 4506053056 in words is "four billion, five hundred six million, fifty-three thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •