Search a number
-
+
110001111020102 = 2232391328500437
BaseRepresentation
bin11001000000101110100001…
…001001011011001001000110
3112102111000002120010110011202
4121000232201021123021012
5103404224233410120402
61025541451320502502
732112214035161321
oct3100564111331106
9472430076113152
10110001111020102
11320602334a2025
1210406b5161aa32
13494c0a25100c3
141d2412170b7b8
15cab5ac023b02
hex640ba125b246

110001111020102 has 8 divisors (see below), whose sum is σ = 172175652031536. Its totient is φ = 52609227009592.

The previous prime is 110001111020057. The next prime is 110001111020111. The reversal of 110001111020102 is 201020111100011.

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

It is a congruent number.

It is an unprimeable number.

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 3 ways as a sum of consecutive naturals, for example, 1195664250173 + ... + 1195664250264.

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

Almost surely, 2110001111020102 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2391328500462.

The product of its (nonzero) digits is 4, while the sum is 11.

Adding to 110001111020102 its reverse (201020111100011), we get a palindrome (311021222120113).

The spelling of 110001111020102 in words is "one hundred ten trillion, one billion, one hundred eleven million, twenty thousand, one hundred two".

Divisors: 1 2 23 46 2391328500437 4782657000874 55000555510051 110001111020102