Base | Representation |
---|---|
bin | 1001011001001011… |
… | …11111000011110101 |
3 | 111000110112011101220 |
4 | 10230211333003311 |
5 | 40312014404141 |
6 | 2152231340553 |
7 | 235654555551 |
oct | 45445770365 |
9 | 14013464356 |
10 | 5043122421 |
11 | 2158790577 |
12 | b88b21759 |
13 | 624a7970c |
14 | 35bac8861 |
15 | 1e7b23766 |
hex | 12c97f0f5 |
5043122421 has 8 divisors (see below), whose sum is σ = 6725892960. Its totient is φ = 3361216752.
The previous prime is 5043122411. The next prime is 5043122429. The reversal of 5043122421 is 1242213405.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5043122421 - 213 = 5043114229 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5043122391 and 5043122400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5043122429) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 202486 + ... + 226023.
It is an arithmetic number, because the mean of its divisors is an integer number (840736620).
Almost surely, 25043122421 is an apocalyptic number.
It is an amenable number.
5043122421 is a deficient number, since it is larger than the sum of its proper divisors (1682770539).
5043122421 is a wasteful number, since it uses less digits than its factorization.
5043122421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 432435.
The product of its (nonzero) digits is 1920, while the sum is 24.
The square root of 5043122421 is about 71014.9450538406. The cubic root of 5043122421 is about 1714.8777685185.
Adding to 5043122421 its reverse (1242213405), we get a palindrome (6285335826).
The spelling of 5043122421 in words is "five billion, forty-three million, one hundred twenty-two thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •