Search a number
-
+
110102110200010 = 2511010211020001
BaseRepresentation
bin11001000010001100100101…
…001010101110000011001010
3112102211122210100220101120201
4121002030211022232003022
5103412403110202400020
61030100113335442414
732122420634063635
oct3102144512560312
9472748710811521
10110102110200010
113209a051940845
1210422639b2640a
13495877a030656
141d28d83344c1c
15cae01dd2ba0a
hex6423252ae0ca

110102110200010 has 8 divisors (see below), whose sum is σ = 198183798360036. Its totient is φ = 44040844080000.

The previous prime is 110102110200001. The next prime is 110102110200013. The reversal of 110102110200010 is 10002011201011.

It can be written as a sum of positive squares in 2 ways, for example, as 92228383880721 + 17873726319289 = 9603561^2 + 4227733^2 .

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

It is a Harshad number since it is a multiple of its sum of digits (10), and also a Moran number because the ratio is a prime number: 11010211020001 = 110102110200010 / (1 + 1 + 0 + 1 + 0 + 2 + 1 + 1 + 0 + 2 + 0 + 0 + 0 + 1 + 0).

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

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

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, 5505105509991 + ... + 5505105510010.

Almost surely, 2110102110200010 is an apocalyptic number.

110102110200010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

The sum of its prime factors is 11010211020008.

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

Adding to 110102110200010 its reverse (10002011201011), we get a palindrome (120104121401021).

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

Divisors: 1 2 5 10 11010211020001 22020422040002 55051055100005 110102110200010