Search a number
-
+
1021101101212 = 22255275275303
BaseRepresentation
bin11101101101111100101…
…11100101000010011100
310121121122021212102122011
432312332113211002130
5113212203340214322
62101030512201004
7133525560103363
oct16667627450234
93547567772564
101021101101212
11364056a51615
12145a90839164
137539bb1b44a
14375c8a767da
151b863ed4677
hexedbe5e509c

1021101101212 has 6 divisors (see below), whose sum is σ = 1786926927128. Its totient is φ = 510550550604.

The previous prime is 1021101101201. The next prime is 1021101101213. The reversal of 1021101101212 is 2121011011201.

It is a happy number.

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

It is a congruent number.

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

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, 127637637648 + ... + 127637637655.

Almost surely, 21021101101212 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 1021101101212 its reverse (2121011011201), we get a palindrome (3142112112413).

The spelling of 1021101101212 in words is "one trillion, twenty-one billion, one hundred one million, one hundred one thousand, two hundred twelve".

Divisors: 1 2 4 255275275303 510550550606 1021101101212