Base | Representation |
---|---|

bin | 110100101011101 |

3 | 1101000000 |

4 | 12211131 |

5 | 1330343 |

6 | 324513 |

7 | 141432 |

oct | 64535 |

9 | 41000 |

10 | 26973 |

11 | 192a1 |

12 | 13739 |

13 | c37b |

14 | 9b89 |

15 | 7ed3 |

hex | 695d |

26973 has 14 divisors (see below), whose sum is σ = 41534. Its totient is φ = 17496.

The previous prime is 26959. The next prime is 26981. The reversal of 26973 is 37962.

Adding to 26973 its sum of digits (27), we get a cube (27000 = 30^{3}).

26973 divided by its sum of digits (27) gives a palindrome (999).

Adding to 26973 its product of digits (2268), we get a square (29241 = 171^{2}).

It can be divided in two parts, 26 and 973, that added together give a palindrome (999).

It can be written as a sum of positive squares in only one way, i.e., 26244 + 729 = 162^2 + 27^2 .

It is not a de Polignac number, because 26973 - 2^{8} = 26717 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (27).

It is a Duffinian number.

It is a nialpdrome in base 9.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (26903) by changing a digit.

It is a polite number, since it can be written in 13 ways as a sum of consecutive naturals, for example, 711 + ... + 747.

26973 is a Friedman number, since it can be written as 37*9^(6/2), using all its digits and the basic arithmetic operations.

2^{26973} is an apocalyptic number.

It is an amenable number.

26973 is a deficient number, since it is larger than the sum of its proper divisors (14561).

26973 is an frugal number, since it uses more digits than its factorization.

26973 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 55 (or 40 counting only the distinct ones).

The product of its digits is 2268, while the sum is 27.

The square root of 26973 is about 164.2345883181. The cubic root of 26973 is about 29.9899966648.

The spelling of 26973 in words is "twenty-six thousand, nine hundred seventy-three".

• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.052 sec. • engine limits •