Base | Representation |
---|---|
bin | 100100110000001001111… |
… | …0001010110101010100101 |
3 | 122212220001201212112102111 |
4 | 1021200103301112222211 |
5 | 1130224341042320333 |
6 | 14424254554041021 |
7 | 1030636526106451 |
oct | 111402361265245 |
9 | 18786051775374 |
10 | 5051213245093 |
11 | 1678231212604 |
12 | 696b61119171 |
13 | 2a84342b50a2 |
14 | 1366a1293661 |
15 | 8b5d886b4cd |
hex | 49813c56aa5 |
5051213245093 has 2 divisors, whose sum is σ = 5051213245094. Its totient is φ = 5051213245092.
The previous prime is 5051213244923. The next prime is 5051213245103. The reversal of 5051213245093 is 3905423121505.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4817423588769 + 233789656324 = 2194863^2 + 483518^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5051213245093 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5051813245093) 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 as a sum of consecutive naturals, namely, 2525606622546 + 2525606622547.
It is an arithmetic number, because the mean of its divisors is an integer number (2525606622547).
Almost surely, 25051213245093 is an apocalyptic number.
It is an amenable number.
5051213245093 is a deficient number, since it is larger than the sum of its proper divisors (1).
5051213245093 is an equidigital number, since it uses as much as digits as its factorization.
5051213245093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162000, while the sum is 40.
Adding to 5051213245093 its reverse (3905423121505), we get a palindrome (8956636366598).
The spelling of 5051213245093 in words is "five trillion, fifty-one billion, two hundred thirteen million, two hundred forty-five thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •