Base | Representation |
---|---|
bin | 1001100010011100… |
… | …10011110011111011 |
3 | 111012212200200210221 |
4 | 10301032103303323 |
5 | 40441411131133 |
6 | 2204044320511 |
7 | 240620046010 |
oct | 46116236373 |
9 | 14185620727 |
10 | 5120802043 |
11 | 2198617405 |
12 | baab43137 |
13 | 637ba68a6 |
14 | 368149707 |
15 | 1ee869a2d |
hex | 131393cfb |
5120802043 has 16 divisors (see below), whose sum is σ = 6191665920. Its totient is φ = 4137116256.
The previous prime is 5120802023. The next prime is 5120802047. The reversal of 5120802043 is 3402080215.
It is not a de Polignac number, because 5120802043 - 225 = 5087247611 is a prime.
It is a super-2 number, since 2×51208020432 = 52445227127185947698, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5120801999 and 5120802017.
It is not an unprimeable number, because it can be changed into a prime (5120802047) 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 15 ways as a sum of consecutive naturals, for example, 71521 + ... + 123922.
It is an arithmetic number, because the mean of its divisors is an integer number (386979120).
Almost surely, 25120802043 is an apocalyptic number.
5120802043 is a deficient number, since it is larger than the sum of its proper divisors (1070863877).
5120802043 is a wasteful number, since it uses less digits than its factorization.
5120802043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 195666.
The product of its (nonzero) digits is 1920, while the sum is 25.
The square root of 5120802043 is about 71559.7795063680. The cubic root of 5120802043 is about 1723.6377446840.
Adding to 5120802043 its reverse (3402080215), we get a palindrome (8522882258).
The spelling of 5120802043 in words is "five billion, one hundred twenty million, eight hundred two thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •