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

bin | 1010001000101010… |

… | …1010101011001111 |

3 | 21000121111010221102 |

4 | 2202022222223033 |

5 | 21033000031411 |

6 | 1125550053315 |

7 | 124264420136 |

oct | 24212525317 |

9 | 7017433842 |

10 | 2720705231 |

11 | 1176849122 |

12 | 63b1aa23b |

13 | 344885b6a |

14 | 1bb4a291d |

15 | 10dcc4d3b |

hex | a22aaacf |

2720705231 has 2 divisors, whose sum is σ = 2720705232. Its totient is φ = 2720705230.

The previous prime is 2720705191. The next prime is 2720705263. The reversal of 2720705231 is 1325070272.

2720705231 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It is a cyclic number.

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

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

It is a junction number, because it is equal to *n*+sod(*n*) for *n* = 2720705194 and 2720705203.

It is a congruent number.

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

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

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

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

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

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

2720705231 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 5880, while the sum is 29.

The square root of 2720705231 is about 52160.3798970061. The cubic root of 2720705231 is about 1396.0270406814.

The spelling of 2720705231 in words is "two billion, seven hundred twenty million, seven hundred five thousand, two hundred thirty-one".

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