Base | Representation |
---|---|
bin | 1001000110001000110101… |
… | …01010010111101011001111 |
3 | 2121211011221102211020010110 |
4 | 10203010122222113223033 |
5 | 10110203310130341421 |
6 | 110312501551011103 |
7 | 4133050634565453 |
oct | 443043252275317 |
9 | 77734842736113 |
10 | 20002110012111 |
11 | 64119357143a7 |
12 | 22b0662209a93 |
13 | b21263498b06 |
14 | 4d2170592663 |
15 | 24a47a229a76 |
hex | 12311aa97acf |
20002110012111 has 16 divisors (see below), whose sum is σ = 26710589047040. Its totient is φ = 13314189127680.
The previous prime is 20002110012107. The next prime is 20002110012113. The reversal of 20002110012111 is 11121001120002.
It is not a de Polignac number, because 20002110012111 - 22 = 20002110012107 is a prime.
It is a super-2 number, since 2×200021100121112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20002110012113) 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 in 15 ways as a sum of consecutive naturals, for example, 21842310 + ... + 22739628.
It is an arithmetic number, because the mean of its divisors is an integer number (1669411815440).
Almost surely, 220002110012111 is an apocalyptic number.
20002110012111 is a deficient number, since it is larger than the sum of its proper divisors (6708479034929).
20002110012111 is a wasteful number, since it uses less digits than its factorization.
20002110012111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 908766.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 20002110012111 its reverse (11121001120002), we get a palindrome (31123111132113).
The spelling of 20002110012111 in words is "twenty trillion, two billion, one hundred ten million, twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •