Base | Representation |
---|---|
bin | 1001001001000001000100… |
… | …01110101100010011101001 |
3 | 2122011122020201201022021222 |
4 | 10210200202032230103221 |
5 | 10113313342413101441 |
6 | 110430140501311425 |
7 | 4143152021160230 |
oct | 444404216542351 |
9 | 78148221638258 |
10 | 20101021222121 |
11 | 644a8824a1464 |
12 | 2307867405575 |
13 | b2a697551108 |
14 | 4d6c74b91b17 |
15 | 24cd18a94d4b |
hex | 1248223ac4e9 |
20101021222121 has 8 divisors (see below), whose sum is σ = 22973960877120. Its totient is φ = 17228422865808.
The previous prime is 20101021222039. The next prime is 20101021222129. The reversal of 20101021222121 is 12122212010102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-20101021222121 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20101021222121.
It is not an unprimeable number, because it can be changed into a prime (20101021222129) 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, 85198451 + ... + 85434056.
It is an arithmetic number, because the mean of its divisors is an integer number (2871745109640).
Almost surely, 220101021222121 is an apocalyptic number.
It is an amenable number.
20101021222121 is a deficient number, since it is larger than the sum of its proper divisors (2872939654999).
20101021222121 is a wasteful number, since it uses less digits than its factorization.
20101021222121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 170649343.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 20101021222121 its reverse (12122212010102), we get a palindrome (32223233232223).
The spelling of 20101021222121 in words is "twenty trillion, one hundred one billion, twenty-one million, two hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •