Base | Representation |
---|---|
bin | 1100011001111011110… |
… | …1011100001110011111 |
3 | 202101002201110012001202 |
4 | 3012132331130032133 |
5 | 11442432244212111 |
6 | 241523415430115 |
7 | 21253214460155 |
oct | 3063675341637 |
9 | 671081405052 |
10 | 213120304031 |
11 | 82424945878 |
12 | 3537968533b |
13 | 171355c329b |
14 | a45a8053d5 |
15 | 582523bb3b |
hex | 319ef5c39f |
213120304031 has 4 divisors (see below), whose sum is σ = 213752708832. Its totient is φ = 212487899232.
The previous prime is 213120304021. The next prime is 213120304051. The reversal of 213120304031 is 130403021312.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 213120304031 - 230 = 212046562207 is a prime.
It is a super-2 number, since 2×2131203040312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 213120303994 and 213120304012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213120304021) 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, 316201895 + ... + 316202568.
It is an arithmetic number, because the mean of its divisors is an integer number (53438177208).
Almost surely, 2213120304031 is an apocalyptic number.
213120304031 is a deficient number, since it is larger than the sum of its proper divisors (632404801).
213120304031 is an equidigital number, since it uses as much as digits as its factorization.
213120304031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 632404800.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 213120304031 its reverse (130403021312), we get a palindrome (343523325343).
The spelling of 213120304031 in words is "two hundred thirteen billion, one hundred twenty million, three hundred four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •