Base | Representation |
---|---|
bin | 1001100010110110… |
… | …01000111100111001 |
3 | 111020010000120111221 |
4 | 10301123020330321 |
5 | 40443241243213 |
6 | 2204244352041 |
7 | 240660454552 |
oct | 46133107471 |
9 | 14203016457 |
10 | 5124165433 |
11 | 219a504372 |
12 | bb00a5621 |
13 | 6387b376a |
14 | 368783329 |
15 | 1eecd138d |
hex | 1316c8f39 |
5124165433 has 4 divisors (see below), whose sum is σ = 5124413520. Its totient is φ = 5123917348.
The previous prime is 5124165421. The next prime is 5124165443. The reversal of 5124165433 is 3345614215.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 5124165433 - 25 = 5124165401 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5124165413) 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 3 ways as a sum of consecutive naturals, for example, 89935 + ... + 135412.
It is an arithmetic number, because the mean of its divisors is an integer number (1281103380).
Almost surely, 25124165433 is an apocalyptic number.
It is an amenable number.
5124165433 is a deficient number, since it is larger than the sum of its proper divisors (248087).
5124165433 is a wasteful number, since it uses less digits than its factorization.
5124165433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 248086.
The product of its digits is 43200, while the sum is 34.
The square root of 5124165433 is about 71583.2762102993. The cubic root of 5124165433 is about 1724.0150291494.
Adding to 5124165433 its reverse (3345614215), we get a palindrome (8469779648).
The spelling of 5124165433 in words is "five billion, one hundred twenty-four million, one hundred sixty-five thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •