Base | Representation |
---|---|
bin | 1001010111000010… |
… | …00000101101000000 |
3 | 110222012111112122122 |
4 | 10223201000231000 |
5 | 40242402304331 |
6 | 2150344023412 |
7 | 235345100636 |
oct | 45341005500 |
9 | 13865445578 |
10 | 5025041216 |
11 | 2149560928 |
12 | b82a61b68 |
13 | 6210b8790 |
14 | 35953d356 |
15 | 1e625117b |
hex | 12b840b40 |
5025041216 has 56 divisors (see below), whose sum is σ = 10752063840. Its totient is φ = 2316344832.
The previous prime is 5025041201. The next prime is 5025041239. The reversal of 5025041216 is 6121405205.
It is a Harshad number since it is a multiple of its sum of digits (26).
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 751295 + ... + 757953.
It is an arithmetic number, because the mean of its divisors is an integer number (192001140).
Almost surely, 25025041216 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 5025041216, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5376031920).
5025041216 is an abundant number, since it is smaller than the sum of its proper divisors (5727022624).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5025041216 is a wasteful number, since it uses less digits than its factorization.
5025041216 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7591 (or 7581 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 26.
The square root of 5025041216 is about 70887.5251084420. The cubic root of 5025041216 is about 1712.8258527533.
The spelling of 5025041216 in words is "five billion, twenty-five million, forty-one thousand, two hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.035 sec. • engine limits •