Search a number
-
+
110010010101 = 3130681280607
BaseRepresentation
bin110011001110100011…
…0111000100111110101
3101111221210020112122120
41212131012320213311
53300300030310401
6122312104150153
710643102441265
oct1463506704765
9344853215576
10110010010101
1142722867922
12193a2168359
13a4b25c3244
14547866b7a5
152cdce23836
hex199d1b89f5

110010010101 has 8 divisors (see below), whose sum is σ = 146681658624. Its totient is φ = 73339184160.

The previous prime is 110010010073. The next prime is 110010010151. The reversal of 110010010101 is 101010010011.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 110010010101 - 29 = 110010009589 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 110010010101.

It is a congruent number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 251740 + ... + 532346.

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

Almost surely, 2110010010101 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 411291.

The product of its (nonzero) digits is 1, while the sum is 6.

Adding to 110010010101 its reverse (101010010011), we get a palindrome (211020020112).

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

Divisors: 1 3 130681 280607 392043 841821 36670003367 110010010101