Base | Representation |
---|---|
bin | 1001001011111001101010… |
… | …00010110011010101100101 |
3 | 2122112010001011122201200211 |
4 | 10211330311002303111211 |
5 | 10121424322001320401 |
6 | 110543450232135421 |
7 | 4153260555333466 |
oct | 445746502632545 |
9 | 78463034581624 |
10 | 20200121120101 |
11 | 648890683559a |
12 | 2322b03837571 |
13 | b36b2b72c8c0 |
14 | 4db99646ad6d |
15 | 2506b8c82951 |
hex | 125f350b3565 |
20200121120101 has 32 divisors (see below), whose sum is σ = 23828599872000. Its totient is φ = 16961629583808.
The previous prime is 20200121120089. The next prime is 20200121120143. The reversal of 20200121120101 is 10102112100202.
It is not a de Polignac number, because 20200121120101 - 241 = 18001097864549 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20200121120171) 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 31 ways as a sum of consecutive naturals, for example, 15491191 + ... + 16744468.
It is an arithmetic number, because the mean of its divisors is an integer number (744643746000).
Almost surely, 220200121120101 is an apocalyptic number.
It is an amenable number.
20200121120101 is a deficient number, since it is larger than the sum of its proper divisors (3628478751899).
20200121120101 is a wasteful number, since it uses less digits than its factorization.
20200121120101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32235793.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 20200121120101 its reverse (10102112100202), we get a palindrome (30302233220303).
The spelling of 20200121120101 in words is "twenty trillion, two hundred billion, one hundred twenty-one million, one hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •