Base | Representation |
---|---|
bin | 1001001001101000010101… |
… | …01100011011010011111001 |
3 | 2122020122122211102010211220 |
4 | 10210310022230123103321 |
5 | 10114140030401400441 |
6 | 110443544330342253 |
7 | 4144526266060104 |
oct | 444641254332371 |
9 | 78218584363756 |
10 | 20122101200121 |
11 | 645880a5aa988 |
12 | 230b96ab8a989 |
13 | b2c6768b928b |
14 | 4d7cb468373b |
15 | 24d64e53e466 |
hex | 124d0ab1b4f9 |
20122101200121 has 8 divisors (see below), whose sum is σ = 26830076504160. Its totient is φ = 13414430014752.
The previous prime is 20122101200111. The next prime is 20122101200147. The reversal of 20122101200121 is 12100210122102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20122101200121 - 26 = 20122101200057 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 20122101200121.
It is not an unprimeable number, because it can be changed into a prime (20122101200101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 75875236 + ... + 76139973.
It is an arithmetic number, because the mean of its divisors is an integer number (3353759563020).
Almost surely, 220122101200121 is an apocalyptic number.
It is an amenable number.
20122101200121 is a deficient number, since it is larger than the sum of its proper divisors (6707975304039).
20122101200121 is a wasteful number, since it uses less digits than its factorization.
20122101200121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 152059335.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 20122101200121 its reverse (12100210122102), we get a palindrome (32222311322223).
The spelling of 20122101200121 in words is "twenty trillion, one hundred twenty-two billion, one hundred one million, two hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •