Base | Representation |
---|---|
bin | 1001011001001011… |
… | …01110001110001011 |
3 | 111000110101122210110 |
4 | 10230211232032023 |
5 | 40312010202301 |
6 | 2152230045403 |
7 | 235654150512 |
oct | 45445561613 |
9 | 14013348713 |
10 | 5043053451 |
11 | 2158743777 |
12 | b88aa9863 |
13 | 624a541c7 |
14 | 35baab679 |
15 | 1e7b0d0d6 |
hex | 12c96e38b |
5043053451 has 8 divisors (see below), whose sum is σ = 7119604944. Its totient is φ = 3164268800.
The previous prime is 5043053447. The next prime is 5043053461. The reversal of 5043053451 is 1543503405.
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 5043053451 - 22 = 5043053447 is a prime.
It is not an unprimeable number, because it can be changed into a prime (5043053461) 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, 49441650 + ... + 49441751.
It is an arithmetic number, because the mean of its divisors is an integer number (889950618).
Almost surely, 25043053451 is an apocalyptic number.
5043053451 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
5043053451 is a deficient number, since it is larger than the sum of its proper divisors (2076551493).
5043053451 is a wasteful number, since it uses less digits than its factorization.
5043053451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98883421.
The product of its (nonzero) digits is 18000, while the sum is 30.
The square root of 5043053451 is about 71014.4594501711. The cubic root of 5043053451 is about 1714.8699508976.
Adding to 5043053451 its reverse (1543503405), we get a palindrome (6586556856).
The spelling of 5043053451 in words is "five billion, forty-three million, fifty-three thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •