Search a number
-
+
91210201101 = 3210134466789
BaseRepresentation
bin101010011110010001…
…1010011100000001101
322201102121002021221100
41110330203103200031
52443244302413401
6105522411053313
76406162626435
oct1247443234015
9281377067840
1091210201101
1135755865098
1215816141239
1387a77789c6
1445b39252c5
15258c72eb86
hex153c8d380d

91210201101 has 6 divisors (see below), whose sum is σ = 131748068270. Its totient is φ = 60806800728.

The previous prime is 91210201003. The next prime is 91210201109. The reversal of 91210201101 is 10110201219.

It is a happy number.

It can be written as a sum of positive squares in only one way, i.e., 62615052900 + 28595148201 = 250230^2 + 169101^2 .

It is not a de Polignac number, because 91210201101 - 27 = 91210200973 is a prime.

It is a super-2 number, since 2×912102011012 (a number of 23 digits) contains 22 as substring.

It is a Duffinian number.

It is a congruent number.

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

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5067233386 + ... + 5067233403.

Almost surely, 291210201101 is an apocalyptic number.

It is an amenable number.

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

91210201101 is a wasteful number, since it uses less digits than its factorization.

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

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

The product of its (nonzero) digits is 36, while the sum is 18.

The spelling of 91210201101 in words is "ninety-one billion, two hundred ten million, two hundred one thousand, one hundred one".

Divisors: 1 3 9 10134466789 30403400367 91210201101