Base | Representation |
---|---|
bin | 1001100000100000… |
… | …01100000101001011 |
3 | 111011202001100112220 |
4 | 10300100030011023 |
5 | 40423224024301 |
6 | 2202303305123 |
7 | 240331453035 |
oct | 46020140513 |
9 | 14152040486 |
10 | 5104517451 |
11 | 218a404570 |
12 | ba55ab1a3 |
13 | 6346c4637 |
14 | 365d0ac55 |
15 | 1ed1ee936 |
hex | 13040c14b |
5104517451 has 8 divisors (see below), whose sum is σ = 7424752704. Its totient is φ = 3093646920.
The previous prime is 5104517449. The next prime is 5104517471. The reversal of 5104517451 is 1547154015.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5104517451 - 21 = 5104517449 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 154682347 = 5104517451 / (5 + 1 + 0 + 4 + 5 + 1 + 7 + 4 + 5 + 1).
It is not an unprimeable number, because it can be changed into a prime (5104517441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 77341141 + ... + 77341206.
It is an arithmetic number, because the mean of its divisors is an integer number (928094088).
Almost surely, 25104517451 is an apocalyptic number.
5104517451 is a deficient number, since it is larger than the sum of its proper divisors (2320235253).
5104517451 is a wasteful number, since it uses less digits than its factorization.
5104517451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154682361.
The product of its (nonzero) digits is 14000, while the sum is 33.
The square root of 5104517451 is about 71445.9057679305. The cubic root of 5104517451 is about 1721.8086989252.
The spelling of 5104517451 in words is "five billion, one hundred four million, five hundred seventeen thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •