Base | Representation |
---|---|
bin | 11001001100010011… |
… | …111010110010000101 |
3 | 2120211011112010200021 |
4 | 121030103322302011 |
5 | 420344310444301 |
6 | 20232053215141 |
7 | 1645220000641 |
oct | 311423726205 |
9 | 76734463607 |
10 | 27050093701 |
11 | 10521088844 |
12 | 52ab0314b1 |
13 | 272119c807 |
14 | 1448761c21 |
15 | a84b7c8a1 |
hex | 64c4fac85 |
27050093701 has 2 divisors, whose sum is σ = 27050093702. Its totient is φ = 27050093700.
The previous prime is 27050093659. The next prime is 27050093729. The reversal of 27050093701 is 10739005072.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16402949476 + 10647144225 = 128074^2 + 103185^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-27050093701 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (27050093761) 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, 13525046850 + 13525046851.
It is an arithmetic number, because the mean of its divisors is an integer number (13525046851).
Almost surely, 227050093701 is an apocalyptic number.
It is an amenable number.
27050093701 is a deficient number, since it is larger than the sum of its proper divisors (1).
27050093701 is an equidigital number, since it uses as much as digits as its factorization.
27050093701 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13230, while the sum is 34.
Adding to 27050093701 its reverse (10739005072), we get a palindrome (37789098773).
The spelling of 27050093701 in words is "twenty-seven billion, fifty million, ninety-three thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •