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

bin | 101000001010… |

… | …001010101001 |

3 | 201210211212202 |

4 | 220022022221 |

5 | 10143334101 |

6 | 1013345545 |

7 | 155324063 |

oct | 50121251 |

9 | 21724782 |

10 | 10527401 |

11 | 5a40435 |

12 | 36382b5 |

13 | 2247941 |

14 | 1580733 |

15 | dce36b |

hex | a0a2a9 |

10527401 has 2 divisors, whose sum is σ = 10527402. Its totient is φ = 10527400.

The previous prime is 10527379. The next prime is 10527421. The reversal of 10527401 is 10472501.

10527401 is nontrivially palindromic in base 5.

It is an a-pointer prime, because the next prime (10527421) can be obtained adding 10527401 to its sum of digits (20).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10394176 + 133225 = 3224^2 + 365^2 .

It is a cyclic number.

It is not a de Polignac number, because 10527401 - 2^{18} = 10265257 is a prime.

It is a super-2 number, since 2×10527401^{2} = 221652343629602, which contains 22 as substring.

It is not a weakly prime, because it can be changed into another prime (10527421) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5263700 + 5263701.

It is an arithmetic number, because the mean of its divisors is an integer number (5263701).

Almost surely, 2^{10527401} is an apocalyptic number.

It is an amenable number.

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

10527401 is an equidigital number, since it uses as much as digits as its factorization.

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

The product of its (nonzero) digits is 280, while the sum is 20.

The square root of 10527401 is about 3244.5956604791. The cubic root of 10527401 is about 219.1662728158.

Adding to 10527401 its reverse (10472501), we get a palindrome (20999902).

The spelling of 10527401 in words is "ten million, five hundred twenty-seven thousand, four hundred one".

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