Base | Representation |
---|---|
bin | 110000011101001100001000… |
… | …010101111000001101110001 |
3 | 1000221120022122012212011111002 |
4 | 300131030020111320031301 |
5 | 210413112111241310413 |
6 | 2033130205110131345 |
7 | 62613562025221235 |
oct | 6035141025701561 |
9 | 1027508565764432 |
10 | 213112122213233 |
11 | 619a4386193391 |
12 | 1ba9a682650b55 |
13 | 91bb50500b969 |
14 | 3a8a978a1c5c5 |
15 | 1998806cc2958 |
hex | c1d308578371 |
213112122213233 has 16 divisors (see below), whose sum is σ = 226612877400000. Its totient is φ = 199848419914752.
The previous prime is 213112122213101. The next prime is 213112122213251. The reversal of 213112122213233 is 332312221211312.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-213112122213233 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 213112122213196 and 213112122213205.
It is not an unprimeable number, because it can be changed into a prime (213112122213433) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 118833608 + ... + 120613641.
It is an arithmetic number, because the mean of its divisors is an integer number (14163304837500).
Almost surely, 2213112122213233 is an apocalyptic number.
It is an amenable number.
213112122213233 is a deficient number, since it is larger than the sum of its proper divisors (13500755186767).
213112122213233 is a wasteful number, since it uses less digits than its factorization.
213112122213233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 239447744.
The product of its digits is 5184, while the sum is 29.
Adding to 213112122213233 its reverse (332312221211312), we get a palindrome (545424343424545).
The spelling of 213112122213233 in words is "two hundred thirteen trillion, one hundred twelve billion, one hundred twenty-two million, two hundred thirteen thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •