Base | Representation |
---|---|
bin | 1001001001000011000111… |
… | …10010000011011110110001 |
3 | 2122011202002101011101011220 |
4 | 10210201203302003132301 |
5 | 10113323120434323441 |
6 | 110430441545455253 |
7 | 4143221204214162 |
oct | 444414362033661 |
9 | 78152071141156 |
10 | 20102121011121 |
11 | 6450297282196 |
12 | 2307b137a1529 |
13 | b2a811359a36 |
14 | 4d6d3ac77769 |
15 | 24cd803d8466 |
hex | 124863c837b1 |
20102121011121 has 8 divisors (see below), whose sum is σ = 26814316591680. Its totient is φ = 13395669718992.
The previous prime is 20102121011111. The next prime is 20102121011123. The reversal of 20102121011121 is 12111012120102.
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 20102121011121 - 211 = 20102121009073 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20102121011121.
It is not an unprimeable number, because it can be changed into a prime (20102121011123) 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, 1436063941 + ... + 1436077938.
It is an arithmetic number, because the mean of its divisors is an integer number (3351789573960).
Almost surely, 220102121011121 is an apocalyptic number.
It is an amenable number.
20102121011121 is a deficient number, since it is larger than the sum of its proper divisors (6712195580559).
20102121011121 is a wasteful number, since it uses less digits than its factorization.
20102121011121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2872144215.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 20102121011121 its reverse (12111012120102), we get a palindrome (32213133131223).
The spelling of 20102121011121 in words is "twenty trillion, one hundred two billion, one hundred twenty-one million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •