Search a number
-
+
1102012111010 = 25110201211101
BaseRepresentation
bin10000000010010101000…
…010100101100010100010
310220100111010012121010202
4100002111002211202202
5121023410100023020
62202131332025202
7142421613250256
oct20022502454242
93810433177122
101102012111010
113953a711a858
121596b1762202
137cbc4902cc5
143b4a27d6266
151d9ec456e75
hex100950a58a2

1102012111010 has 8 divisors (see below), whose sum is σ = 1983621799836. Its totient is φ = 440804844400.

The previous prime is 1102012111003. The next prime is 1102012111051. The reversal of 1102012111010 is 101112102011.

It can be written as a sum of positive squares in 2 ways, for example, as 1098645674569 + 3366436441 = 1048163^2 + 58021^2 .

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

It is a Curzon number.

It is a junction number, because it is equal to n+sod(n) for n = 1102012110982 and 1102012111000.

It is an unprimeable number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 55100605541 + ... + 55100605560.

Almost surely, 21102012111010 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 110201211108.

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

Adding to 1102012111010 its reverse (101112102011), we get a palindrome (1203124213021).

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

Divisors: 1 2 5 10 110201211101 220402422202 551006055505 1102012111010