Base | Representation |
---|---|
bin | 101111110011000111100100… |
… | …000001111000101000110101 |
3 | 1000120022221010221100122010210 |
4 | 233303013210001320220311 |
5 | 210023230102000031401 |
6 | 2023034105535340033 |
7 | 62164652232003054 |
oct | 5763074401705065 |
9 | 1016287127318123 |
10 | 210221000002101 |
11 | 60a8a253061a00 |
12 | 1b6b22a3681619 |
13 | 903b9a834c2ca |
14 | 39caa71c6839b |
15 | 19484e5da44d6 |
hex | bf31e4078a35 |
210221000002101 has 48 divisors (see below), whose sum is σ = 315458060202432. Its totient is φ = 124394408624640.
The previous prime is 210221000002099. The next prime is 210221000002193. The reversal of 210221000002101 is 101200000122012.
210221000002101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 210221000002101 - 21 = 210221000002099 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210221000004101) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 35497746 + ... + 40994291.
It is an arithmetic number, because the mean of its divisors is an integer number (6572042920884).
Almost surely, 2210221000002101 is an apocalyptic number.
It is an amenable number.
210221000002101 is a deficient number, since it is larger than the sum of its proper divisors (105237060200331).
210221000002101 is a wasteful number, since it uses less digits than its factorization.
210221000002101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 76492242 (or 76492231 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 210221000002101 its reverse (101200000122012), we get a palindrome (311421000124113).
The spelling of 210221000002101 in words is "two hundred ten trillion, two hundred twenty-one billion, two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •