Base | Representation |
---|---|
bin | 11101000110101010100… |
… | …011000001011001011001 |
3 | 21002012101220112211220001 |
4 | 131012222203001121121 |
5 | 230232020400200441 |
6 | 4130444053133001 |
7 | 264332246565322 |
oct | 35065243013131 |
9 | 7065356484801 |
10 | 2000021100121 |
11 | 701227852700 |
12 | 28374b02a161 |
13 | 1167a7a41455 |
14 | 6cb315c3449 |
15 | 37059c99731 |
hex | 1d1aa8c1659 |
2000021100121 has 6 divisors (see below), whose sum is σ = 2198370300266. Its totient is φ = 1818201000000.
The previous prime is 2000021100083. The next prime is 2000021100127. The reversal of 2000021100121 is 1210011200002.
It can be written as a sum of positive squares in only one way, i.e., 1567030779721 + 432990320400 = 1251811^2 + 658020^2 .
It is not a de Polignac number, because 2000021100121 - 223 = 2000012711513 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2000021100098 and 2000021100107.
It is not an unprimeable number, because it can be changed into a prime (2000021100127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 8264549880 + ... + 8264550121.
Almost surely, 22000021100121 is an apocalyptic number.
It is an amenable number.
2000021100121 is a deficient number, since it is larger than the sum of its proper divisors (198349200145).
2000021100121 is a wasteful number, since it uses less digits than its factorization.
2000021100121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16529100023 (or 16529100012 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 2000021100121 its reverse (1210011200002), we get a palindrome (3210032300123).
The spelling of 2000021100121 in words is "two trillion, twenty-one million, one hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •