Search a number
-
+
10020021002002 = 211501001909091
BaseRepresentation
bin1001000111001111011111…
…0010101101111100010010
31022110220102111021112102001
42101303313302231330102
52303132000334031002
633151044544344214
72052631314142444
oct221636762557422
938426374245361
1010020021002002
1132135156a8170
121159b4491506a
13578b64ca767b
14268d86120494
1512599c95ba87
hex91cf7cadf12

10020021002002 has 16 divisors (see below), whose sum is σ = 16396448766624. Its totient is φ = 4554540900000.

The previous prime is 10020021001981. The next prime is 10020021002029. The reversal of 10020021002002 is 20020012002001.

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

It is a self number, because there is not a number n which added to its sum of digits gives 10020021002002.

It is an unprimeable number.

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

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

Almost surely, 210020021002002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1410105.

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

Adding to 10020021002002 its reverse (20020012002001), we get a palindrome (30040033004003).

Subtracting 10020021002002 from its reverse (20020012002001), we obtain a palindrome (9999990999999).

The spelling of 10020021002002 in words is "ten trillion, twenty billion, twenty-one million, two thousand, two".

Divisors: 1 2 11 22 501001 909091 1002002 1818182 5511011 10000001 11022022 20000002 455455500091 910911000182 5010010501001 10020021002002