Search a number
-
+
110100002100202 = 255050001050101
BaseRepresentation
bin11001000010001010100111…
…100000111101001111101010
3112102211110100110010211022001
4121002022213200331033222
5103412334301014201302
61030055124231521214
732122314455403232
oct3102124740751752
9472743313124261
10110100002100202
113209916a9801a4
121042214bb2920a
134958502367b0a
141d28c2338acc2
15cade48c14787
hex6422a783d3ea

110100002100202 has 4 divisors (see below), whose sum is σ = 165150003150306. Its totient is φ = 55050001050100.

The previous prime is 110100002100199. The next prime is 110100002100239. The reversal of 110100002100202 is 202001200001011.

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., 90773084755081 + 19326917345121 = 9527491^2 + 4396239^2 .

It is an unprimeable number.

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

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27525000525049 + ... + 27525000525052.

Almost surely, 2110100002100202 is an apocalyptic number.

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

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

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

The sum of its prime factors is 55050001050103.

The product of its (nonzero) digits is 8, while the sum is 10.

Adding to 110100002100202 its reverse (202001200001011), we get a palindrome (312101202101213).

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

Divisors: 1 2 55050001050101 110100002100202