Base | Representation |
---|---|
bin | 1001110000100100… |
… | …11001101101101101 |
3 | 111112010200210110011 |
4 | 10320102121231231 |
5 | 41212231042214 |
6 | 2223520413221 |
7 | 243556305514 |
oct | 47022315555 |
9 | 14463623404 |
10 | 5239315309 |
11 | 2249503158 |
12 | 1022777211 |
13 | 6565ccb97 |
14 | 379b9967b |
15 | 209e79ac4 |
hex | 138499b6d |
5239315309 has 8 divisors (see below), whose sum is σ = 5306215032. Its totient is φ = 5172710400.
The previous prime is 5239315307. The next prime is 5239315321. The reversal of 5239315309 is 9035139325.
It can be written as a sum of positive squares in 4 ways, for example, as 489073225 + 4750242084 = 22115^2 + 68922^2 .
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 5239315309 - 21 = 5239315307 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 (5239315307) 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, 37824 + ... + 109129.
It is an arithmetic number, because the mean of its divisors is an integer number (663276879).
Almost surely, 25239315309 is an apocalyptic number.
It is an amenable number.
5239315309 is a deficient number, since it is larger than the sum of its proper divisors (66899723).
5239315309 is a wasteful number, since it uses less digits than its factorization.
5239315309 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147407.
The product of its (nonzero) digits is 109350, while the sum is 40.
The square root of 5239315309 is about 72383.1148058717. The cubic root of 5239315309 is about 1736.8334654643.
The spelling of 5239315309 in words is "five billion, two hundred thirty-nine million, three hundred fifteen thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •