Search a number
-
+
20112100102012 = 225028025025503
BaseRepresentation
bin1001001001010101101101…
…00101010000111101111100
32122012200211211120201101211
410210222312211100331330
510114004040111231022
6110435212104214204
74144023406122502
oct444526645207574
978180754521354
1020112100102012
116454548205946
122309a3976a364
13b2b741906049
144d7606316672
1524d266515e77
hex124ab6950f7c

20112100102012 has 6 divisors (see below), whose sum is σ = 35196175178528. Its totient is φ = 10056050051004.

The previous prime is 20112100102007. The next prime is 20112100102019. The reversal of 20112100102012 is 21020100121102.

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

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (20112100102019) 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, 2514012512748 + ... + 2514012512755.

Almost surely, 220112100102012 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 20112100102012 its reverse (21020100121102), we get a palindrome (41132200223114).

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

Divisors: 1 2 4 5028025025503 10056050051006 20112100102012