Base | Representation |
---|---|
bin | 110000011110111011111110… |
… | …110011100111010000010101 |
3 | 1000221222210122010111221012102 |
4 | 300132323332303213100111 |
5 | 210422044042124221323 |
6 | 2033301310302531445 |
7 | 62625343136616254 |
oct | 6036737663472025 |
9 | 1027883563457172 |
10 | 213232221320213 |
11 | 61a40305a89aa7 |
12 | 1bab99bb596b85 |
13 | 91c99348b61c4 |
14 | 3a926cd1a279b |
15 | 199b9d5803328 |
hex | c1eefece7415 |
213232221320213 has 8 divisors (see below), whose sum is σ = 213492624214848. Its totient is φ = 212971821610464.
The previous prime is 213232221320179. The next prime is 213232221320267. The reversal of 213232221320213 is 312023122232312.
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 213232221320213 - 228 = 213231952884757 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 (213232221320413) 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, 150788306 + ... + 152195852.
It is an arithmetic number, because the mean of its divisors is an integer number (26686578026856).
Almost surely, 2213232221320213 is an apocalyptic number.
It is an amenable number.
213232221320213 is a deficient number, since it is larger than the sum of its proper divisors (260402894635).
213232221320213 is a wasteful number, since it uses less digits than its factorization.
213232221320213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1592443.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 213232221320213 its reverse (312023122232312), we get a palindrome (525255343552525).
The spelling of 213232221320213 in words is "two hundred thirteen trillion, two hundred thirty-two billion, two hundred twenty-one million, three hundred twenty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •