Base | Representation |
---|---|
bin | 100101000011101100010… |
… | …1101000010001000001101 |
3 | 200000220100220112112222002 |
4 | 1022013120231002020031 |
5 | 1131421304003221423 |
6 | 14455434302202045 |
7 | 1033653356044655 |
oct | 112073055021015 |
9 | 20026326475862 |
10 | 5093171929613 |
11 | 1694002859289 |
12 | 6a3110b83325 |
13 | 2ac3900a7471 |
14 | 138721a43365 |
15 | 8c7422a4228 |
hex | 4a1d8b4220d |
5093171929613 has 2 divisors, whose sum is σ = 5093171929614. Its totient is φ = 5093171929612.
The previous prime is 5093171929609. The next prime is 5093171929631. The reversal of 5093171929613 is 3169291713905.
Together with next prime (5093171929631) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4886389828324 + 206782101289 = 2210518^2 + 454733^2 .
It is a cyclic number.
It is not a de Polignac number, because 5093171929613 - 22 = 5093171929609 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5093171929663) 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 as a sum of consecutive naturals, namely, 2546585964806 + 2546585964807.
It is an arithmetic number, because the mean of its divisors is an integer number (2546585964807).
Almost surely, 25093171929613 is an apocalyptic number.
It is an amenable number.
5093171929613 is a deficient number, since it is larger than the sum of its proper divisors (1).
5093171929613 is an equidigital number, since it uses as much as digits as its factorization.
5093171929613 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2755620, while the sum is 56.
The spelling of 5093171929613 in words is "five trillion, ninety-three billion, one hundred seventy-one million, nine hundred twenty-nine thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •