Base | Representation |
---|---|
bin | 1001100111101000… |
… | …00010011101011000 |
3 | 111022220102220220200 |
4 | 10303310002131120 |
5 | 41034021344442 |
6 | 2212235422200 |
7 | 241655242221 |
oct | 46364023530 |
9 | 14286386820 |
10 | 5164246872 |
11 | 22100a0124 |
12 | 10015b4960 |
13 | 643ba83a5 |
14 | 36dc18248 |
15 | 20359c34c |
hex | 133d02758 |
5164246872 has 96 divisors (see below), whose sum is σ = 14250600000. Its totient is φ = 1689024960.
The previous prime is 5164246853. The next prime is 5164246877. The reversal of 5164246872 is 2786424615.
5164246872 is a `hidden beast` number, since 516 + 4 + 2 + 4 + 68 + 72 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5164246877) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3444379 + ... + 3445877.
It is an arithmetic number, because the mean of its divisors is an integer number (148443750).
Almost surely, 25164246872 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 5164246872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7125300000).
5164246872 is an abundant number, since it is smaller than the sum of its proper divisors (9086353128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5164246872 is a wasteful number, since it uses less digits than its factorization.
5164246872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2381 (or 2374 counting only the distinct ones).
The product of its digits is 645120, while the sum is 45.
The square root of 5164246872 is about 71862.6945779241. The cubic root of 5164246872 is about 1728.4984657004.
The spelling of 5164246872 in words is "five billion, one hundred sixty-four million, two hundred forty-six thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •