Base | Representation |
---|---|
bin | 1100011001011111011… |
… | …1100011011101110111 |
3 | 202100210102120012002022 |
4 | 3012113313203131313 |
5 | 11442211314222221 |
6 | 241503525303355 |
7 | 21250241230643 |
oct | 3062767433567 |
9 | 670712505068 |
10 | 213001320311 |
11 | 8237376861a |
12 | 35345864b5b |
13 | 17116a63b10 |
14 | a448ab1c23 |
15 | 5819a874ab |
hex | 3197de3777 |
213001320311 has 8 divisors (see below), whose sum is σ = 234720596880. Its totient is φ = 192044123712.
The previous prime is 213001320307. The next prime is 213001320347. The reversal of 213001320311 is 113023100312.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 213001320311 - 22 = 213001320307 is a prime.
It is a super-2 number, since 2×2130013203112 (a number of 23 digits) contains 22 as substring.
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 213001320311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213001320611) 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, 190519406 + ... + 190520523.
It is an arithmetic number, because the mean of its divisors is an integer number (29340074610).
Almost surely, 2213001320311 is an apocalyptic number.
213001320311 is a deficient number, since it is larger than the sum of its proper divisors (21719276569).
213001320311 is a wasteful number, since it uses less digits than its factorization.
213001320311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 381039985.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 213001320311 its reverse (113023100312), we get a palindrome (326024420623).
The spelling of 213001320311 in words is "two hundred thirteen billion, one million, three hundred twenty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •