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

bin | 1001001100101011001 |

3 | 120022110000 |

4 | 1021211121 |

5 | 34121101 |

6 | 10243213 |

7 | 2363502 |

oct | 1114531 |

9 | 508400 |

10 | 301401 |

11 | 1964a1 |

12 | 126509 |

13 | a7259 |

14 | 7bba9 |

15 | 5e486 |

hex | 49959 |

301401 has 15 divisors (see below), whose sum is σ = 457743. Its totient is φ = 197640.

The previous prime is 301381. The next prime is 301403. The reversal of 301401 is 104103.

Adding to 301401 its reverse (104103), we get a palindrome (405504).

It can be divided in two parts, 30 and 1401, that added together give a triangular number (1431 = T_{53}).

The square root of 301401 is 549.

It is a perfect power (a square), and thus also a powerful number.

It can be written as a sum of positive squares in only one way, i.e., 9801 + 291600 = 99^2 + 540^2 .

It is not a de Polignac number, because 301401 - 2^{9} = 300889 is a prime.

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

It is an inconsummate number, since it does not exist a number *n* which divided by its sum of digits gives 301401.

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

It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 4911 + ... + 4971.

2^{301401} is an apocalyptic number.

301401 is the 549-th square number.

301401 is the 275-th centered octagonal number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 12, while the sum is 9.

The cubic root of 301401 is about 67.0473416059.

The spelling of 301401 in words is "three hundred one thousand, four hundred one", and thus it is an iban number.

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