Base | Representation |
---|---|
bin | 1100011001100100001… |
… | …0101111011110100111 |
3 | 202100211210122120010022 |
4 | 3012121002233132213 |
5 | 11442231340432221 |
6 | 241505511545355 |
7 | 21250600611335 |
oct | 3063102573647 |
9 | 670753576108 |
10 | 213021030311 |
11 | 823838aaa81 |
12 | 3535038b25b |
13 | 1711ab7523b |
14 | a44b562b55 |
15 | 581b67c4ab |
hex | 31990af7a7 |
213021030311 has 8 divisors (see below), whose sum is σ = 215939391360. Its totient is φ = 210120197472.
The previous prime is 213021030289. The next prime is 213021030337. The reversal of 213021030311 is 113030120312.
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-213021030311 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 213021030311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213021030811) 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, 4357580 + ... + 4406193.
It is an arithmetic number, because the mean of its divisors is an integer number (26992423920).
Almost surely, 2213021030311 is an apocalyptic number.
213021030311 is a deficient number, since it is larger than the sum of its proper divisors (2918361049).
213021030311 is a wasteful number, since it uses less digits than its factorization.
213021030311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8764105.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 213021030311 its reverse (113030120312), we get a palindrome (326051150623).
Subtracting from 213021030311 its reverse (113030120312), we obtain a palindrome (99990909999).
The spelling of 213021030311 in words is "two hundred thirteen billion, twenty-one million, thirty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •