Base | Representation |
---|---|
bin | 1001010111001110… |
… | …00000010010001001 |
3 | 110222022110100212012 |
4 | 10223213000102021 |
5 | 40243303043421 |
6 | 2150441425305 |
7 | 235364333351 |
oct | 45347002211 |
9 | 13868410765 |
10 | 5026612361 |
11 | 214a4342a1 |
12 | b8349b235 |
13 | 621518954 |
14 | 35982bb61 |
15 | 1e646195b |
hex | 12b9c0489 |
5026612361 has 2 divisors, whose sum is σ = 5026612362. Its totient is φ = 5026612360.
The previous prime is 5026612291. The next prime is 5026612363. The reversal of 5026612361 is 1632166205.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4664890000 + 361722361 = 68300^2 + 19019^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5026612361 is a prime.
Together with 5026612363, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (5026612363) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2513306180 + 2513306181.
It is an arithmetic number, because the mean of its divisors is an integer number (2513306181).
Almost surely, 25026612361 is an apocalyptic number.
It is an amenable number.
5026612361 is a deficient number, since it is larger than the sum of its proper divisors (1).
5026612361 is an equidigital number, since it uses as much as digits as its factorization.
5026612361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12960, while the sum is 32.
The square root of 5026612361 is about 70898.6061992759. The cubic root of 5026612361 is about 1713.0043466361.
Adding to 5026612361 its reverse (1632166205), we get a palindrome (6658778566).
The spelling of 5026612361 in words is "five billion, twenty-six million, six hundred twelve thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •