Base | Representation |
---|---|
bin | 1100011001100001100… |
… | …1000101011010101001 |
3 | 202100211001002202102211 |
4 | 3012120121011122221 |
5 | 11442221042010441 |
6 | 241504441525121 |
7 | 21250406030134 |
oct | 3063031053251 |
9 | 670731082384 |
10 | 213010110121 |
11 | 82378721526 |
12 | 353487a37a1 |
13 | 171188208a3 |
14 | a449d1d21b |
15 | 581a721a81 |
hex | 31986456a9 |
213010110121 has 4 divisors (see below), whose sum is σ = 213057251200. Its totient is φ = 212962969044.
The previous prime is 213010110077. The next prime is 213010110133. The reversal of 213010110121 is 121011010312.
It is a happy number.
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 213010110121 - 27 = 213010109993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (213010110161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23563761 + ... + 23572798.
It is an arithmetic number, because the mean of its divisors is an integer number (53264312800).
Almost surely, 2213010110121 is an apocalyptic number.
It is an amenable number.
213010110121 is a deficient number, since it is larger than the sum of its proper divisors (47141079).
213010110121 is an equidigital number, since it uses as much as digits as its factorization.
213010110121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47141078.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 213010110121 its reverse (121011010312), we get a palindrome (334021120433).
The spelling of 213010110121 in words is "two hundred thirteen billion, ten million, one hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •