Search a number
-
+
1110201101212 = 22739650039329
BaseRepresentation
bin10000001001111101001…
…001000110101110011100
310221010121211020101212011
4100021331021012232130
5121142142440214322
62210004102321004
7143131550441260
oct20117511065634
93833554211764
101110201101212
11398919640355
1215b1b8129164
13808cb347038
143ba3c2180a0
151dd2b334677
hex1027d246b9c

1110201101212 has 12 divisors (see below), whose sum is σ = 2220402202480. Its totient is φ = 475800471936.

The previous prime is 1110201101161. The next prime is 1110201101249. The reversal of 1110201101212 is 2121011020111.

It is a happy number.

1110201101212 is an admirable number.

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

It is a congruent number.

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 in 3 ways as a sum of consecutive naturals, for example, 19825019637 + ... + 19825019692.

Almost surely, 21110201101212 is an apocalyptic number.

It is an amenable number.

1110201101212 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 39650039340 (or 39650039338 counting only the distinct ones).

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

Adding to 1110201101212 its reverse (2121011020111), we get a palindrome (3231212121323).

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

Divisors: 1 2 4 7 14 28 39650039329 79300078658 158600157316 277550275303 555100550606 1110201101212