Base | Representation |
---|---|
bin | 1001100001110000… |
… | …01001000000000000 |
3 | 111012110202110000000 |
4 | 10300320021000000 |
5 | 40433414144332 |
6 | 2203320000000 |
7 | 240516463005 |
oct | 46070110000 |
9 | 14173673000 |
10 | 5114990592 |
11 | 2195308158 |
12 | ba9000000 |
13 | 63692066a |
14 | 3674758ac |
15 | 1ee0bcb7c |
hex | 130e09000 |
5114990592 has 208 divisors, whose sum is σ = 15367626560. Its totient is φ = 1702010880.
The previous prime is 5114990579. The next prime is 5114990597. The reversal of 5114990592 is 2950994115.
5114990592 is a `hidden beast` number, since 5 + 11 + 49 + 9 + 0 + 592 = 666.
It is a nialpdrome in base 12.
It is not an unprimeable number, because it can be changed into a prime (5114990597) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8957667 + ... + 8958237.
It is an arithmetic number, because the mean of its divisors is an integer number (73882820).
Almost surely, 25114990592 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 5114990592, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7683813280).
5114990592 is an abundant number, since it is smaller than the sum of its proper divisors (10252635968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5114990592 is an frugal number, since it uses more digits than its factorization.
5114990592 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 616 (or 576 counting only the distinct ones).
The product of its (nonzero) digits is 145800, while the sum is 45.
The square root of 5114990592 is about 71519.1624112028. The cubic root of 5114990592 is about 1722.9854622306.
The spelling of 5114990592 in words is "five billion, one hundred fourteen million, nine hundred ninety thousand, five hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •