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

bin | 11101111001010011… |

… | …110110111110000101 |

3 | 10001212002211222101101 |

4 | 131321103312332011 |

5 | 1011220101120401 |

6 | 22425130500101 |

7 | 2214316445302 |

oct | 357123667605 |

9 | 101762758341 |

10 | 32100020101 |

11 | 12682696236 |

12 | 627a294631 |

13 | 304748c146 |

14 | 17a72dc0a9 |

15 | c7d197101 |

hex | 7794f6f85 |

32100020101 has 2 divisors, whose sum is σ = 32100020102. Its totient is φ = 32100020100.

The previous prime is 32100020011. The next prime is 32100020123. The reversal of 32100020101 is 10102000123.

Adding to 32100020101 its reverse (10102000123), we get a palindrome (42202020224).

Together with previous prime (32100020011) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 31831912225 + 268107876 = 178415^2 + 16374^2 .

It is a cyclic number.

It is not a de Polignac number, because 32100020101 - 2^{27} = 31965802373 is a prime.

It is a super-2 number, since 2×32100020101^{2} (a number of 22 digits) contains 22 as substring.

It is a congruent number.

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

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

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

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

It is an amenable number.

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

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

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

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

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

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