Base | Representation |
---|---|
bin | 110000011110111011111101… |
… | …100010101101110010010111 |
3 | 1000221222210120122121111210022 |
4 | 300132323331202231302113 |
5 | 210422044021212111203 |
6 | 2033301304224215355 |
7 | 62625342461432450 |
oct | 6036737542556227 |
9 | 1027883518544708 |
10 | 213232200113303 |
11 | 61a402a5014a28 |
12 | 1bab99b446a55b |
13 | 91c993039c637 |
14 | 3a926ca442127 |
15 | 199b9d3a14a38 |
hex | c1eefd8adc97 |
213232200113303 has 16 divisors (see below), whose sum is σ = 247691838850560. Its totient is φ = 179772105823200.
The previous prime is 213232200113293. The next prime is 213232200113311. The reversal of 213232200113303 is 303311002232312.
It is a cyclic number.
It is not a de Polignac number, because 213232200113303 - 222 = 213232195918999 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 (213232200113333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 33952718 + ... + 39739796.
It is an arithmetic number, because the mean of its divisors is an integer number (15480739928160).
Almost surely, 2213232200113303 is an apocalyptic number.
213232200113303 is a deficient number, since it is larger than the sum of its proper divisors (34459638737257).
213232200113303 is an equidigital number, since it uses as much as digits as its factorization.
213232200113303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5873438.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 213232200113303 its reverse (303311002232312), we get a palindrome (516543202345615).
The spelling of 213232200113303 in words is "two hundred thirteen trillion, two hundred thirty-two billion, two hundred million, one hundred thirteen thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •