Base | Representation |
---|---|
bin | 1100011001111001111… |
… | …0010000101111100011 |
3 | 202101002011001221010112 |
4 | 3012132132100233203 |
5 | 11442423201134111 |
6 | 241522524321535 |
7 | 21253055135546 |
oct | 3063636205743 |
9 | 671064057115 |
10 | 213112130531 |
11 | 82420272a13 |
12 | 353769a32ab |
13 | 171339c0bb1 |
14 | a4596b885d |
15 | 5824674e8b |
hex | 319e790be3 |
213112130531 has 8 divisors (see below), whose sum is σ = 216736518960. Its totient is φ = 209488152832.
The previous prime is 213112130519. The next prime is 213112130593. The reversal of 213112130531 is 135031211312.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-213112130531 is a prime.
It is a super-2 number, since 2×2131121305312 (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 = 213112130497 and 213112130506.
It is not an unprimeable number, because it can be changed into a prime (213112130731) 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, 1053611 + ... + 1239483.
It is an arithmetic number, because the mean of its divisors is an integer number (27092064870).
Almost surely, 2213112130531 is an apocalyptic number.
213112130531 is a deficient number, since it is larger than the sum of its proper divisors (3624388429).
213112130531 is a wasteful number, since it uses less digits than its factorization.
213112130531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 205365.
The product of its (nonzero) digits is 540, while the sum is 23.
Adding to 213112130531 its reverse (135031211312), we get a palindrome (348143341843).
The spelling of 213112130531 in words is "two hundred thirteen billion, one hundred twelve million, one hundred thirty thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •