Base | Representation |
---|---|
bin | 1010011110001000… |
… | …10101000001000000 |
3 | 112111202211220001101 |
4 | 11033010111001000 |
5 | 43003101031031 |
6 | 2325452144144 |
7 | 256206656464 |
oct | 51704250100 |
9 | 15452756041 |
10 | 5621502016 |
11 | 2425211739 |
12 | 110a768054 |
13 | 6b7845470 |
14 | 3b48444a4 |
15 | 22d7c0361 |
hex | 14f115040 |
5621502016 has 84 divisors (see below), whose sum is σ = 12163998532. Its totient is φ = 2562379776.
The previous prime is 5621502011. The next prime is 5621502083. The reversal of 5621502016 is 6102051265.
It can be written as a sum of positive squares in 6 ways, for example, as 2884119616 + 2737382400 = 53704^2 + 52320^2 .
It is not an unprimeable number, because it can be changed into a prime (5621502011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6589846 + ... + 6590698.
Almost surely, 25621502016 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 5621502016, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6081999266).
5621502016 is an abundant number, since it is smaller than the sum of its proper divisors (6542496516).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5621502016 is an equidigital number, since it uses as much as digits as its factorization.
5621502016 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1056 (or 957 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 28.
The square root of 5621502016 is about 74976.6764800895. The cubic root of 5621502016 is about 1778.0779252575.
The spelling of 5621502016 in words is "five billion, six hundred twenty-one million, five hundred two thousand, sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •