Base | Representation |
---|---|
bin | 1001011100111010… |
… | …10110110000000000 |
3 | 111002122101222012012 |
4 | 10232131112300000 |
5 | 40343022231332 |
6 | 2155310152052 |
7 | 236514545432 |
oct | 45635266000 |
9 | 14078358165 |
10 | 5074414592 |
11 | 2174413875 |
12 | b974b2628 |
13 | 62b3b48b0 |
14 | 361d12652 |
15 | 1ea7553b2 |
hex | 12e756c00 |
5074414592 has 132 divisors (see below), whose sum is σ = 11613367920. Its totient is φ = 2202599424.
The previous prime is 5074414591. The next prime is 5074414603. The reversal of 5074414592 is 2954144705.
It is not an unprimeable number, because it can be changed into a prime (5074414591) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3846509 + ... + 3847827.
It is an arithmetic number, because the mean of its divisors is an integer number (87980060).
Almost surely, 25074414592 is an apocalyptic number.
5074414592 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5074414592, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5806683960).
5074414592 is an abundant number, since it is smaller than the sum of its proper divisors (6538953328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5074414592 is a wasteful number, since it uses less digits than its factorization.
5074414592 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1386 (or 1351 counting only the distinct ones).
The product of its (nonzero) digits is 201600, while the sum is 41.
The square root of 5074414592 is about 71234.9253667048. The cubic root of 5074414592 is about 1718.4173507421.
The spelling of 5074414592 in words is "five billion, seventy-four million, four hundred fourteen thousand, five hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •