Base | Representation |
---|---|
bin | 101111110011000111100101… |
… | …001110100110010101001001 |
3 | 1000120022221012100012100000022 |
4 | 233303013211032212111021 |
5 | 210023230122122042301 |
6 | 2023034111534350225 |
7 | 62164652564641100 |
oct | 5763074516462511 |
9 | 1016287170170008 |
10 | 210221020112201 |
11 | 60a8a263447a1a |
12 | 1b6b22aa35b375 |
13 | 903b9ac570887 |
14 | 39caa747c1037 |
15 | 19484e7a27d1b |
hex | bf31e53a6549 |
210221020112201 has 48 divisors (see below), whose sum is σ = 248556921845760. Its totient is φ = 177245297349120.
The previous prime is 210221020112161. The next prime is 210221020112291. The reversal of 210221020112201 is 102211020122012.
It is a de Polignac number, because none of the positive numbers 2k-210221020112201 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 210221020112201.
It is not an unprimeable number, because it can be changed into a prime (210221020112291) 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, 3450798020 + ... + 3450858938.
It is an arithmetic number, because the mean of its divisors is an integer number (5178269205120).
Almost surely, 2210221020112201 is an apocalyptic number.
It is an amenable number.
210221020112201 is a deficient number, since it is larger than the sum of its proper divisors (38335901733559).
210221020112201 is a wasteful number, since it uses less digits than its factorization.
210221020112201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 63574 (or 63567 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 210221020112201 its reverse (102211020122012), we get a palindrome (312432040234213).
The spelling of 210221020112201 in words is "two hundred ten trillion, two hundred twenty-one billion, twenty million, one hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •