Search a number
-
+
1101010212012 = 223312959704871
BaseRepresentation
bin10000000001011001010…
…100101001010010101100
310220020220021221212002110
4100001121110221102230
5121014332103241022
62201444101524020
7142355026250034
oct20013124512254
93806807855073
101101010212012
11394a3261a257
12159472113610
137ca9517c669
143b4097128c4
151d98e4ed00c
hex100595294ac

1101010212012 has 24 divisors (see below), whose sum is σ = 2651895565312. Its totient is φ = 355164584400.

The previous prime is 1101010212011. The next prime is 1101010212023. The reversal of 1101010212012 is 2102120101011.

It is a Harshad number since it is a multiple of its sum of digits (12).

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1479852064 + ... + 1479852807.

Almost surely, 21101010212012 is an apocalyptic number.

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

It is an amenable number.

1101010212012 is an abundant number, since it is smaller than the sum of its proper divisors (1550885353300).

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

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

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

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

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

Adding to 1101010212012 its reverse (2102120101011), we get a palindrome (3203130313023).

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

Divisors: 1 2 3 4 6 12 31 62 93 124 186 372 2959704871 5919409742 8879114613 11838819484 17758229226 35516458452 91750851001 183501702002 275252553003 367003404004 550505106006 1101010212012