Search a number
-
+
110010010201 = 72131221114143
BaseRepresentation
bin110011001110100011…
…0111000101001011001
3101111221210020112210021
41212131012320221121
53300300030311301
6122312104150441
710643102441500
oct1463506705131
9344853215707
10110010010201
1142722867a03
12193a2168421
13a4b25c32c0
14547866b837
152cdce238a1
hex199d1b8a59

110010010201 has 24 divisors (see below), whose sum is σ = 137835769344. Its totient is φ = 87027605280.

The previous prime is 110010010177. The next prime is 110010010223. The reversal of 110010010201 is 102010010011.

It is not a de Polignac number, because 110010010201 - 27 = 110010010073 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (7).

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

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7771336 + ... + 7785478.

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

Almost surely, 2110010010201 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 2, while the sum is 7.

Adding to 110010010201 its reverse (102010010011), we get a palindrome (212020020212).

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

Divisors: 1 7 13 49 91 637 12211 14143 85477 99001 158743 183859 598339 693007 1111201 1287013 7778407 9009091 172700173 1208901211 2245102249 8462308477 15715715743 110010010201