Base | Representation |
---|---|
bin | 1001000110101100001111… |
… | …10000000110111011010101 |
3 | 2121220000000021122212010111 |
4 | 10203112013300012323111 |
5 | 10111011223221231401 |
6 | 110325324155123021 |
7 | 4134323006644366 |
oct | 443260760067325 |
9 | 77800007585114 |
10 | 20021120102101 |
11 | 6419a00391378 |
12 | 22b4288743471 |
13 | b22ca2a5a081 |
14 | 4d30551d5b6d |
15 | 24abde108e51 |
hex | 123587c06ed5 |
20021120102101 has 8 divisors (see below), whose sum is σ = 20351451317600. Its totient is φ = 19690857149040.
The previous prime is 20021120102083. The next prime is 20021120102147. The reversal of 20021120102101 is 10120102112002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20021120102101 - 25 = 20021120102069 is a prime.
It is a super-2 number, since 2×200211201021012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20021120202101) 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, 16474011 + ... + 17647528.
It is an arithmetic number, because the mean of its divisors is an integer number (2543931414700).
Almost surely, 220021120102101 is an apocalyptic number.
It is an amenable number.
20021120102101 is a deficient number, since it is larger than the sum of its proper divisors (330331215499).
20021120102101 is an equidigital number, since it uses as much as digits as its factorization.
20021120102101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34131219.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 20021120102101 its reverse (10120102112002), we get a palindrome (30141222214103).
The spelling of 20021120102101 in words is "twenty trillion, twenty-one billion, one hundred twenty million, one hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •