Base | Representation |
---|---|
bin | 1100101110111001101100… |
… | …11110110100111111111101 |
3 | 10200010202101121112020212002 |
4 | 12113130312132310333331 |
5 | 12132222100244304233 |
6 | 135314533324552045 |
7 | 5616630201564002 |
oct | 627346636647775 |
9 | 120122347466762 |
10 | 27999805853693 |
11 | 8a157184a6283 |
12 | 31826723b2625 |
13 | 12814a78c010b |
14 | 6cb2aabdd8a9 |
15 | 338514c4b6e8 |
hex | 1977367b4ffd |
27999805853693 has 2 divisors, whose sum is σ = 27999805853694. Its totient is φ = 27999805853692.
The previous prime is 27999805853603. The next prime is 27999805853843. The reversal of 27999805853693 is 39635850899972.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 27124649345689 + 875156508004 = 5208133^2 + 935498^2 .
It is a cyclic number.
It is not a de Polignac number, because 27999805853693 - 220 = 27999804805117 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (27999805853603) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 13999902926846 + 13999902926847.
It is an arithmetic number, because the mean of its divisors is an integer number (13999902926847).
Almost surely, 227999805853693 is an apocalyptic number.
It is an amenable number.
27999805853693 is a deficient number, since it is larger than the sum of its proper divisors (1).
27999805853693 is an equidigital number, since it uses as much as digits as its factorization.
27999805853693 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7936185600, while the sum is 83.
The spelling of 27999805853693 in words is "twenty-seven trillion, nine hundred ninety-nine billion, eight hundred five million, eight hundred fifty-three thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •