Base | Representation |
---|---|
bin | 1001001001000001001111… |
… | …01001011110101000110101 |
3 | 2122011122111001202220121012 |
4 | 10210200213221132220311 |
5 | 10113314034201130401 |
6 | 110430153510002005 |
7 | 4143154203654122 |
oct | 444404751365065 |
9 | 78148431686535 |
10 | 20101112130101 |
11 | 644a919842a22 |
12 | 2307891946305 |
13 | b2a6b0330412 |
14 | 4d6c82c97749 |
15 | 24cd21a508bb |
hex | 124827a5ea35 |
20101112130101 has 4 divisors (see below), whose sum is σ = 20102619086400. Its totient is φ = 20099605173804.
The previous prime is 20101112130049. The next prime is 20101112130107. The reversal of 20101112130101 is 10103121110102.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20101112130101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20101112130107) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 753458141 + ... + 753484818.
It is an arithmetic number, because the mean of its divisors is an integer number (5025654771600).
Almost surely, 220101112130101 is an apocalyptic number.
It is an amenable number.
20101112130101 is a deficient number, since it is larger than the sum of its proper divisors (1506956299).
20101112130101 is a wasteful number, since it uses less digits than its factorization.
20101112130101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1506956298.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 20101112130101 its reverse (10103121110102), we get a palindrome (30204233240203).
The spelling of 20101112130101 in words is "twenty trillion, one hundred one billion, one hundred twelve million, one hundred thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •