Base | Representation |
---|---|
bin | 101111110010111111010010… |
… | …001001101000110110101001 |
3 | 1000120022002012101110022221021 |
4 | 233302333102021220312221 |
5 | 210023103400142010441 |
6 | 2023030035450212441 |
7 | 62164216024113460 |
oct | 5762772211506651 |
9 | 1016262171408837 |
10 | 210212110110121 |
11 | 60a86500a36539 |
12 | 1b6b0622424121 |
13 | 903abbc6415b2 |
14 | 39ca46b3159d7 |
15 | 19481756c73d1 |
hex | bf2fd2268da9 |
210212110110121 has 8 divisors (see below), whose sum is σ = 240763544771904. Its totient is φ = 179790958752720.
The previous prime is 210212110110097. The next prime is 210212110110137. The reversal of 210212110110121 is 121011011212012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 210212110110121 - 29 = 210212110109609 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 210212110110095 and 210212110110104.
It is not an unprimeable number, because it can be changed into a prime (210212110110161) 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, 32570822635 + ... + 32570829088.
It is an arithmetic number, because the mean of its divisors is an integer number (30095443096488).
Almost surely, 2210212110110121 is an apocalyptic number.
It is an amenable number.
210212110110121 is a deficient number, since it is larger than the sum of its proper divisors (30551434661783).
210212110110121 is an equidigital number, since it uses as much as digits as its factorization.
210212110110121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65141652191.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 210212110110121 its reverse (121011011212012), we get a palindrome (331223121322133).
The spelling of 210212110110121 in words is "two hundred ten trillion, two hundred twelve billion, one hundred ten million, one hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •