Base | Representation |
---|---|
bin | 1100011001110111010… |
… | …0111101010011101101 |
3 | 202101001101200211120122 |
4 | 3012131310331103231 |
5 | 11442412413144041 |
6 | 241521500254325 |
7 | 21252564121505 |
oct | 3063564752355 |
9 | 671041624518 |
10 | 213101303021 |
11 | 82415148062 |
12 | 353732413a5 |
13 | 1713169c799 |
14 | a45809aa05 |
15 | 5823736c4b |
hex | 319dd3d4ed |
213101303021 has 4 divisors (see below), whose sum is σ = 216281919552. Its totient is φ = 209920686492.
The previous prime is 213101303017. The next prime is 213101303033. The reversal of 213101303021 is 120303101312.
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 213101303021 - 22 = 213101303017 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213101300021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1590308165 + ... + 1590308298.
It is an arithmetic number, because the mean of its divisors is an integer number (54070479888).
Almost surely, 2213101303021 is an apocalyptic number.
It is an amenable number.
213101303021 is a deficient number, since it is larger than the sum of its proper divisors (3180616531).
213101303021 is an equidigital number, since it uses as much as digits as its factorization.
213101303021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3180616530.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 213101303021 its reverse (120303101312), we get a palindrome (333404404333).
The spelling of 213101303021 in words is "two hundred thirteen billion, one hundred one million, three hundred three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •