Base | Representation |
---|---|
bin | 1001100011110001000000… |
… | …01100001011011011110101 |
3 | 2202102111120121102021212201 |
4 | 10301320200030023123311 |
5 | 10223343141130310401 |
6 | 112412301043544501 |
7 | 4266436631030656 |
oct | 461704014133365 |
9 | 82374517367781 |
10 | 21020110010101 |
11 | 6774640120194 |
12 | 2435a0838b131 |
13 | b96259994027 |
14 | 52954342552d |
15 | 266babd48b01 |
hex | 131e2030b6f5 |
21020110010101 has 8 divisors (see below), whose sum is σ = 22126585817600. Its totient is φ = 19913649625440.
The previous prime is 21020110010099. The next prime is 21020110010171. The reversal of 21020110010101 is 10101001102012.
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 21020110010101 - 21 = 21020110010099 is a prime.
It is a super-3 number, since 3×210201100101013 (a number of 41 digits) contains 333 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 (21020110010171) 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, 1004040 + ... + 6561121.
It is an arithmetic number, because the mean of its divisors is an integer number (2765823227200).
Almost surely, 221020110010101 is an apocalyptic number.
It is an amenable number.
21020110010101 is a deficient number, since it is larger than the sum of its proper divisors (1106475807499).
21020110010101 is a wasteful number, since it uses less digits than its factorization.
21020110010101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7711419.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 21020110010101 its reverse (10101001102012), we get a palindrome (31121111112113).
The spelling of 21020110010101 in words is "twenty-one trillion, twenty billion, one hundred ten million, ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •