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

bin | 1001011010000100… |

… | …0100001100000011 |

3 | 20111222201000012011 |

4 | 2112201010030003 |

5 | 20132431002212 |

6 | 1054324513351 |

7 | 116402162536 |

oct | 22641041403 |

9 | 6458630164 |

10 | 2525250307 |

11 | 108648aa28 |

12 | 5a584b857 |

13 | 313230568 |

14 | 19d544a1d |

15 | eba674a7 |

hex | 96844303 |

2525250307 has 2 divisors, whose sum is σ = 2525250308. Its totient is φ = 2525250306.

The previous prime is 2525250283. The next prime is 2525250323. The reversal of 2525250307 is 7030525252.

Adding to 2525250307 its reverse (7030525252), we get a palindrome (9555775559).

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2^{k}-2525250307 is a prime.

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

It is an alternating number because its digits alternate between even and odd.

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

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

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

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

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

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

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

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

The product of its (nonzero) digits is 21000, while the sum is 31.

The square root of 2525250307 is about 50251.8686916218. The cubic root of 2525250307 is about 1361.7628356683.

The spelling of 2525250307 in words is "two billion, five hundred twenty-five million, two hundred fifty thousand, three hundred seven".

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