Base | Representation |
---|---|
bin | 1001110111111101… |
… | …01111011000111000 |
3 | 111200110021102102000 |
4 | 10323332233120320 |
5 | 41324111120242 |
6 | 2234012341000 |
7 | 245241023610 |
oct | 47376573070 |
9 | 14613242360 |
10 | 5301270072 |
11 | 228047973a |
12 | 103b474760 |
13 | 6663b27c7 |
14 | 3840c5a40 |
15 | 210616a4c |
hex | 13bfaf638 |
5301270072 has 256 divisors, whose sum is σ = 18396979200. Its totient is φ = 1379358720.
The previous prime is 5301270067. The next prime is 5301270113. The reversal of 5301270072 is 2700721035.
5301270072 is a `hidden beast` number, since 530 + 127 + 0 + 0 + 7 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 793498 + ... + 800150.
It is an arithmetic number, because the mean of its divisors is an integer number (71863200).
Almost surely, 25301270072 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 5301270072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9198489600).
5301270072 is an abundant number, since it is smaller than the sum of its proper divisors (13095709128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5301270072 is a wasteful number, since it uses less digits than its factorization.
5301270072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6723 (or 6713 counting only the distinct ones).
The product of its (nonzero) digits is 2940, while the sum is 27.
The square root of 5301270072 is about 72809.8212605964. The cubic root of 5301270072 is about 1743.6526597993.
The spelling of 5301270072 in words is "five billion, three hundred one million, two hundred seventy thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •