Base | Representation |
---|---|
bin | 1001100100101000… |
… | …01010011000000000 |
3 | 111021011011000101000 |
4 | 10302110022120000 |
5 | 41011103112342 |
6 | 2205541012000 |
7 | 241231513053 |
oct | 46224123000 |
9 | 14234130330 |
10 | 5139113472 |
11 | 21a7994019 |
12 | bb50b4000 |
13 | 63b91855c |
14 | 36a754a9a |
15 | 20128544c |
hex | 13250a600 |
5139113472 has 160 divisors (see below), whose sum is σ = 15386738400. Its totient is φ = 1693384704.
The previous prime is 5139113453. The next prime is 5139113489. The reversal of 5139113472 is 2743119315.
5139113472 is a `hidden beast` number, since 513 + 9 + 1 + 134 + 7 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1228248 + ... + 1232424.
It is an arithmetic number, because the mean of its divisors is an integer number (96167115).
Almost surely, 25139113472 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 5139113472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7693369200).
5139113472 is an abundant number, since it is smaller than the sum of its proper divisors (10247624928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5139113472 is an equidigital number, since it uses as much as digits as its factorization.
5139113472 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4293 (or 4271 counting only the distinct ones).
The product of its digits is 22680, while the sum is 36.
The square root of 5139113472 is about 71687.6103102900. The cubic root of 5139113472 is about 1725.6898140930.
The spelling of 5139113472 in words is "five billion, one hundred thirty-nine million, one hundred thirteen thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •