Base | Representation |
---|---|
bin | 1001100000100000… |
… | …01011000000010001 |
3 | 111011202001010111120 |
4 | 10300100023000101 |
5 | 40423223404131 |
6 | 2202303232453 |
7 | 240331434135 |
oct | 46020130021 |
9 | 14152033446 |
10 | 5104513041 |
11 | 218a401221 |
12 | ba55a8729 |
13 | 6346c2624 |
14 | 365d093c5 |
15 | 1ed1ed496 |
hex | 13040b011 |
5104513041 has 16 divisors (see below), whose sum is σ = 7438837248. Its totient is φ = 3099513600.
The previous prime is 5104513021. The next prime is 5104513061. The reversal of 5104513041 is 1403154015.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (5104513021) and next prime (5104513061).
It is not a de Polignac number, because 5104513041 - 213 = 5104504849 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (5104513021) 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, 1612750 + ... + 1615911.
It is an arithmetic number, because the mean of its divisors is an integer number (464927328).
Almost surely, 25104513041 is an apocalyptic number.
5104513041 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
It is an amenable number.
5104513041 is a deficient number, since it is larger than the sum of its proper divisors (2334324207).
5104513041 is a wasteful number, since it uses less digits than its factorization.
5104513041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3228712.
The product of its (nonzero) digits is 1200, while the sum is 24.
The square root of 5104513041 is about 71445.8749054135. The cubic root of 5104513041 is about 1721.8082030783.
Adding to 5104513041 its reverse (1403154015), we get a palindrome (6507667056).
The spelling of 5104513041 in words is "five billion, one hundred four million, five hundred thirteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •