Search a number
-
+
110102322013202 = 255051161006601
BaseRepresentation
bin11001000010001100110001…
…110010101110010000010010
3112102211200100010110121122202
4121002030301302232100102
5103412404023413410302
61030100150343403202
732122426115342051
oct3102146162562022
9472750303417582
10110102322013202
113209a150462172
1210422698a53502
1349587b1b928bc
141d28da3520398
15cae03271b202
hex642331cae412

110102322013202 has 4 divisors (see below), whose sum is σ = 165153483019806. Its totient is φ = 55051161006600.

The previous prime is 110102322013133. The next prime is 110102322013253. The reversal of 110102322013202 is 202310223201011.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in only one way, i.e., 108703540357801 + 1398781655401 = 10426099^2 + 1182701^2 .

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 as a sum of consecutive naturals, namely, 27525580503299 + ... + 27525580503302.

Almost surely, 2110102322013202 is an apocalyptic number.

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

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

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

The sum of its prime factors is 55051161006603.

The product of its (nonzero) digits is 288, while the sum is 20.

Adding to 110102322013202 its reverse (202310223201011), we get a palindrome (312412545214213).

The spelling of 110102322013202 in words is "one hundred ten trillion, one hundred two billion, three hundred twenty-two million, thirteen thousand, two hundred two".

Divisors: 1 2 55051161006601 110102322013202