Base | Representation |
---|---|
bin | 1001000110101100001110… |
… | …10001100101110011101001 |
3 | 2121212222222201121102012221 |
4 | 10203112013101211303221 |
5 | 10111011214144231441 |
6 | 110325323311434041 |
7 | 4134322551645004 |
oct | 443260721456351 |
9 | 77788881542187 |
10 | 20021112102121 |
11 | 64199a6917919 |
12 | 22b4285b25921 |
13 | b22ca11b8960 |
14 | 4d305411253b |
15 | 24abdd5788d1 |
hex | 123587465ce9 |
20021112102121 has 8 divisors (see below), whose sum is σ = 21571962128640. Its totient is φ = 18471799858512.
The previous prime is 20021112102071. The next prime is 20021112102137. The reversal of 20021112102121 is 12120121112002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20021112102121 - 237 = 19883673148649 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20021112102095 and 20021112102104.
It is not an unprimeable number, because it can be changed into a prime (20021112102151) 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, 384418681 + ... + 384470758.
It is an arithmetic number, because the mean of its divisors is an integer number (2696495266080).
Almost surely, 220021112102121 is an apocalyptic number.
It is an amenable number.
20021112102121 is a deficient number, since it is larger than the sum of its proper divisors (1550850026519).
20021112102121 is a wasteful number, since it uses less digits than its factorization.
20021112102121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 768891455.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 20021112102121 its reverse (12120121112002), we get a palindrome (32141233214123).
The spelling of 20021112102121 in words is "twenty trillion, twenty-one billion, one hundred twelve million, one hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.533 sec. • engine limits •