Base | Representation |
---|---|
bin | 101111110010110101001001… |
… | …000111110100011100000101 |
3 | 1000120021001002112002101221022 |
4 | 233302311021013310130011 |
5 | 210022414100113020401 |
6 | 2023021035151400525 |
7 | 62163352134064436 |
oct | 5762651107643405 |
9 | 1016231075071838 |
10 | 210201221220101 |
11 | 60a81923498281 |
12 | 1b6aa4a3823145 |
13 | 9039b7574a5c7 |
14 | 39c9b170c948d |
15 | 1947c3978471b |
hex | bf2d491f4705 |
210201221220101 has 16 divisors (see below), whose sum is σ = 224297085397440. Its totient is φ = 196408660705920.
The previous prime is 210201221220077. The next prime is 210201221220121. The reversal of 210201221220101 is 101022122102012.
It is a cyclic number.
It is not a de Polignac number, because 210201221220101 - 218 = 210201220957957 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 210201221220101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210201221220121) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 224633486 + ... + 225567296.
It is an arithmetic number, because the mean of its divisors is an integer number (14018567837340).
Almost surely, 2210201221220101 is an apocalyptic number.
It is an amenable number.
210201221220101 is a deficient number, since it is larger than the sum of its proper divisors (14095864177339).
210201221220101 is a wasteful number, since it uses less digits than its factorization.
210201221220101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1096196.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 210201221220101 its reverse (101022122102012), we get a palindrome (311223343322113).
The spelling of 210201221220101 in words is "two hundred ten trillion, two hundred one billion, two hundred twenty-one million, two hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •