Base | Representation |
---|---|
bin | 101101101101001111011001… |
… | …111001010000011100000101 |
3 | 222100202102100211010002102002 |
4 | 231231033121321100130011 |
5 | 202322012012031120401 |
6 | 1551311435505355045 |
7 | 60225201011303465 |
oct | 5555173171203405 |
9 | 870672324102362 |
10 | 201021010020101 |
11 | 59062593605317 |
12 | 1a667275638a85 |
13 | 882227a26a27b |
14 | 378d67c54bba5 |
15 | 1839040081a6b |
hex | b6d3d9e50705 |
201021010020101 has 4 divisors (see below), whose sum is σ = 202555521547104. Its totient is φ = 199486498493100.
The previous prime is 201021010019989. The next prime is 201021010020133. The reversal of 201021010020101 is 101020010120102.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 201021010020101 - 210 = 201021010019077 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201021010020301) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 767255763305 + ... + 767255763566.
It is an arithmetic number, because the mean of its divisors is an integer number (50638880386776).
Almost surely, 2201021010020101 is an apocalyptic number.
It is an amenable number.
201021010020101 is a deficient number, since it is larger than the sum of its proper divisors (1534511527003).
201021010020101 is a wasteful number, since it uses less digits than its factorization.
201021010020101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1534511527002.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 201021010020101 its reverse (101020010120102), we get a palindrome (302041020140203).
The spelling of 201021010020101 in words is "two hundred one trillion, twenty-one billion, ten million, twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.320 sec. • engine limits •