Base | Representation |
---|---|
bin | 1001011000111100… |
… | …11001001110100011 |
3 | 111000022210001200022 |
4 | 10230132121032203 |
5 | 40311012214301 |
6 | 2152120544055 |
7 | 235631630105 |
oct | 45436311643 |
9 | 14008701608 |
10 | 5041132451 |
11 | 2157651473 |
12 | b8832202b |
13 | 624530a14 |
14 | 35b72b575 |
15 | 1e787dd1b |
hex | 12c7993a3 |
5041132451 has 8 divisors (see below), whose sum is σ = 5481931680. Its totient is φ = 4616362368.
The previous prime is 5041132441. The next prime is 5041132469. The reversal of 5041132451 is 1542311405.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5041132451 - 210 = 5041131427 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5041132451.
It is not an unprimeable number, because it can be changed into a prime (5041132441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4006631 + ... + 4007888.
It is an arithmetic number, because the mean of its divisors is an integer number (685241460).
Almost surely, 25041132451 is an apocalyptic number.
5041132451 is a deficient number, since it is larger than the sum of its proper divisors (440799229).
5041132451 is a wasteful number, since it uses less digits than its factorization.
5041132451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8014573.
The product of its (nonzero) digits is 2400, while the sum is 26.
The square root of 5041132451 is about 71000.9327473942. The cubic root of 5041132451 is about 1714.6521804813.
Adding to 5041132451 its reverse (1542311405), we get a palindrome (6583443856).
The spelling of 5041132451 in words is "five billion, forty-one million, one hundred thirty-two thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •