Base | Representation |
---|---|
bin | 1001010100010110… |
… | …01110111110000000 |
3 | 110220122012010201121 |
4 | 10222023032332000 |
5 | 40221123232024 |
6 | 2144222042024 |
7 | 234653006140 |
oct | 45213167600 |
9 | 13818163647 |
10 | 5002555264 |
11 | 21378a28a3 |
12 | b77419314 |
13 | 619544995 |
14 | 356568920 |
15 | 1e42ad8e4 |
hex | 12a2cef80 |
5002555264 has 64 divisors (see below), whose sum is σ = 11404448640. Its totient is φ = 2141185536.
The previous prime is 5002555241. The next prime is 5002555267. The reversal of 5002555264 is 4625552005.
It is a tau number, because it is divible by the number of its divisors (64).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5002555267) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 788007 + ... + 794329.
It is an arithmetic number, because the mean of its divisors is an integer number (178194510).
Almost surely, 25002555264 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 5002555264, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5702224320).
5002555264 is an abundant number, since it is smaller than the sum of its proper divisors (6401893376).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5002555264 is an equidigital number, since it uses as much as digits as its factorization.
5002555264 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7227 (or 7215 counting only the distinct ones).
The product of its (nonzero) digits is 60000, while the sum is 34.
The square root of 5002555264 is about 70728.7442557833. The cubic root of 5002555264 is about 1710.2671930667.
The spelling of 5002555264 in words is "five billion, two million, five hundred fifty-five thousand, two hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •