Search a number
-
+
1020102011212 = 222539110043933
BaseRepresentation
bin11101101100000101101…
…00010110100101001100
310121112001122220101210211
432312002310112211030
5113203132103324322
62100343422212204
7133462036012504
oct16660264264514
93545048811724
101020102011212
11363693a9a4a9
12145852124064
137526cb3c52b
14375320c4a04
151b806432b77
hexed82d1694c

1020102011212 has 12 divisors (see below), whose sum is σ = 1785249004896. Its totient is φ = 510030866960.

The previous prime is 1020102011207. The next prime is 1020102011351. The reversal of 1020102011212 is 2121102010201.

It is a super-2 number, since 2×10201020112122 (a number of 25 digits) contains 22 as substring.

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

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, 4920403 + ... + 5123530.

It is an arithmetic number, because the mean of its divisors is an integer number (148770750408).

Almost surely, 21020102011212 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 1020102011212 its reverse (2121102010201), we get a palindrome (3141204021413).

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

Divisors: 1 2 4 25391 50782 101564 10043933 20087866 40175732 255025502803 510051005606 1020102011212