Base | Representation |
---|---|
bin | 1100011001111001101… |
… | …1001001001001111101 |
3 | 202101002002112101201101 |
4 | 3012132123021021331 |
5 | 11442422444004041 |
6 | 241522455013101 |
7 | 21253045162255 |
oct | 3063633111175 |
9 | 671062471641 |
10 | 213111313021 |
11 | 8241a864792 |
12 | 3537666a191 |
13 | 17133795a69 |
14 | a459544965 |
15 | 5824562b31 |
hex | 319e6c927d |
213111313021 has 4 divisors (see below), whose sum is σ = 218067390112. Its totient is φ = 208155235932.
The previous prime is 213111313001. The next prime is 213111313033. The reversal of 213111313021 is 120313111312.
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 213111313021 - 29 = 213111312509 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 213111313021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213111313001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2478038481 + ... + 2478038566.
It is an arithmetic number, because the mean of its divisors is an integer number (54516847528).
Almost surely, 2213111313021 is an apocalyptic number.
It is an amenable number.
213111313021 is a deficient number, since it is larger than the sum of its proper divisors (4956077091).
213111313021 is an equidigital number, since it uses as much as digits as its factorization.
213111313021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4956077090.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 213111313021 its reverse (120313111312), we get a palindrome (333424424333).
The spelling of 213111313021 in words is "two hundred thirteen billion, one hundred eleven million, three hundred thirteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •