Search a number
-
+
201010100112002 = 2100505050056001
BaseRepresentation
bin101101101101000101001111…
…100111010000101010000010
3222100201101012111012100000202
4231231011033213100222002
5202321322141112041002
61551302433140245202
760224333444515316
oct5555051747205202
9870641174170022
10201010100112002
11590589a5210945
121a66512b9a0802
13882122bbc764c
14378cd2560db46
151838b0238b502
hexb6d14f9d0a82

201010100112002 has 4 divisors (see below), whose sum is σ = 301515150168006. Its totient is φ = 100505050056000.

The previous prime is 201010100111999. The next prime is 201010100112037. The reversal of 201010100112002 is 200211001010102.

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., 116782841305321 + 84227258806681 = 10806611^2 + 9177541^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, 50252525027999 + ... + 50252525028002.

Almost surely, 2201010100112002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 100505050056003.

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

Adding to 201010100112002 its reverse (200211001010102), we get a palindrome (401221101122104).

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

Divisors: 1 2 100505050056001 201010100112002