Base | Representation |
---|---|
bin | 1001100011110000111111… |
… | …01010010001100001001001 |
3 | 2202102111112222200201212021 |
4 | 10301320133222101201021 |
5 | 10223343131341401441 |
6 | 112412300125244441 |
7 | 4266436462342333 |
oct | 461703752214111 |
9 | 82374488621767 |
10 | 21020101122121 |
11 | 67746360aa552 |
12 | 2435a05403721 |
13 | b96257ba167a |
14 | 529542190453 |
15 | 266bab1903d1 |
hex | 131e1fa91849 |
21020101122121 has 8 divisors (see below), whose sum is σ = 21273548677920. Its totient is φ = 20766658169472.
The previous prime is 21020101122101. The next prime is 21020101122169. The reversal of 21020101122121 is 12122110102012.
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 21020101122121 - 229 = 21019564251209 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21020101122095 and 21020101122104.
It is not an unprimeable number, because it can be changed into a prime (21020101122101) 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, 8524650 + ... + 10710268.
It is an arithmetic number, because the mean of its divisors is an integer number (2659193584740).
Almost surely, 221020101122121 is an apocalyptic number.
It is an amenable number.
21020101122121 is a deficient number, since it is larger than the sum of its proper divisors (253447555799).
21020101122121 is a wasteful number, since it uses less digits than its factorization.
21020101122121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2301575.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 21020101122121 its reverse (12122110102012), we get a palindrome (33142211224133).
The spelling of 21020101122121 in words is "twenty-one trillion, twenty billion, one hundred one million, one hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •