Base | Representation |
---|---|
bin | 1001111000100011… |
… | …01101100111011101 |
3 | 111200210122002201212 |
4 | 10330101231213131 |
5 | 41331344243144 |
6 | 2234311114205 |
7 | 245331216545 |
oct | 47421554735 |
9 | 14623562655 |
10 | 5306243549 |
11 | 2283266352 |
12 | 1041072965 |
13 | 6674344a9 |
14 | 384a1c325 |
15 | 210c9a49e |
hex | 13c46d9dd |
5306243549 has 4 divisors (see below), whose sum is σ = 5325127260. Its totient is φ = 5287359840.
The previous prime is 5306243533. The next prime is 5306243573. The reversal of 5306243549 is 9453426035.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4603622500 + 702621049 = 67850^2 + 26507^2 .
It is a cyclic number.
It is not a de Polignac number, because 5306243549 - 24 = 5306243533 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5306243249) 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 3 ways as a sum of consecutive naturals, for example, 9441434 + ... + 9441995.
It is an arithmetic number, because the mean of its divisors is an integer number (1331281815).
Almost surely, 25306243549 is an apocalyptic number.
It is an amenable number.
5306243549 is a deficient number, since it is larger than the sum of its proper divisors (18883711).
5306243549 is a wasteful number, since it uses less digits than its factorization.
5306243549 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18883710.
The product of its (nonzero) digits is 388800, while the sum is 41.
The square root of 5306243549 is about 72843.9671421045. The cubic root of 5306243549 is about 1744.1977685350.
The spelling of 5306243549 in words is "five billion, three hundred six million, two hundred forty-three thousand, five hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •