Base | Representation |
---|---|
bin | 100110100101001000110… |
… | …1010110001001100000101 |
3 | 200202220111201012100200212 |
4 | 1031022101222301030011 |
5 | 1143333340442113414 |
6 | 15135523201045205 |
7 | 1055042150346632 |
oct | 115122152611405 |
9 | 20686451170625 |
10 | 5302433551109 |
11 | 1764827561822 |
12 | 717792326805 |
13 | 2c602c127c36 |
14 | 1448d3b9d189 |
15 | 92ddd88283e |
hex | 4d291ab1305 |
5302433551109 has 2 divisors, whose sum is σ = 5302433551110. Its totient is φ = 5302433551108.
The previous prime is 5302433551091. The next prime is 5302433551111. The reversal of 5302433551109 is 9011553342035.
Together with previous prime (5302433551091) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3345526330084 + 1956907221025 = 1829078^2 + 1398895^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5302433551109 is a prime.
Together with 5302433551111, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5302433551169) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2651216775554 + 2651216775555.
It is an arithmetic number, because the mean of its divisors is an integer number (2651216775555).
Almost surely, 25302433551109 is an apocalyptic number.
It is an amenable number.
5302433551109 is a deficient number, since it is larger than the sum of its proper divisors (1).
5302433551109 is an equidigital number, since it uses as much as digits as its factorization.
5302433551109 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 243000, while the sum is 41.
The spelling of 5302433551109 in words is "five trillion, three hundred two billion, four hundred thirty-three million, five hundred fifty-one thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •