Base | Representation |
---|---|
bin | 1001001001100110011111… |
… | …01111010100000010011101 |
3 | 2122020120002220020200221220 |
4 | 10210303033233110002131 |
5 | 10114131014144213041 |
6 | 110443302234443553 |
7 | 4144462625630211 |
oct | 444631757240235 |
9 | 78216086220856 |
10 | 20121112101021 |
11 | 6458352252108 |
12 | 230b7338935b9 |
13 | b2c5499c7a39 |
14 | 4d7c1d172941 |
15 | 24d5e27b2d66 |
hex | 124ccfbd409d |
20121112101021 has 8 divisors (see below), whose sum is σ = 27693573644544. Its totient is φ = 12981362645760.
The previous prime is 20121112101017. The next prime is 20121112101031. The reversal of 20121112101021 is 12010121112102.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20121112101021 - 22 = 20121112101017 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20121112101031) 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 7 ways as a sum of consecutive naturals, for example, 108178021956 + ... + 108178022141.
It is an arithmetic number, because the mean of its divisors is an integer number (3461696705568).
Almost surely, 220121112101021 is an apocalyptic number.
It is an amenable number.
20121112101021 is a deficient number, since it is larger than the sum of its proper divisors (7572461543523).
20121112101021 is a wasteful number, since it uses less digits than its factorization.
20121112101021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 216356044131.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 20121112101021 its reverse (12010121112102), we get a palindrome (32131233213123).
The spelling of 20121112101021 in words is "twenty trillion, one hundred twenty-one billion, one hundred twelve million, one hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •