Base | Representation |
---|---|
bin | 110000011011100110100111… |
… | …111110100101000001011101 |
3 | 1000221011220022110020121212202 |
4 | 300123212213332211001131 |
5 | 210404320403103411143 |
6 | 2033004142044541245 |
7 | 62602653105640331 |
oct | 6033464776450135 |
9 | 1027156273217782 |
10 | 213003131310173 |
11 | 6196213670a796 |
12 | 1ba81525851825 |
13 | 91b11558b5749 |
14 | 3a855998737c1 |
15 | 1995a785a6ab8 |
hex | c1b9a7fa505d |
213003131310173 has 2 divisors, whose sum is σ = 213003131310174. Its totient is φ = 213003131310172.
The previous prime is 213003131310131. The next prime is 213003131310239. The reversal of 213003131310173 is 371013131300312.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 183841111675204 + 29162019634969 = 13558802^2 + 5400187^2 .
It is a cyclic number.
It is not a de Polignac number, because 213003131310173 - 234 = 212985951440989 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (213003131310113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106501565655086 + 106501565655087.
It is an arithmetic number, because the mean of its divisors is an integer number (106501565655087).
Almost surely, 2213003131310173 is an apocalyptic number.
It is an amenable number.
213003131310173 is a deficient number, since it is larger than the sum of its proper divisors (1).
213003131310173 is an equidigital number, since it uses as much as digits as its factorization.
213003131310173 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3402, while the sum is 29.
Adding to 213003131310173 its reverse (371013131300312), we get a palindrome (584016262610485).
The spelling of 213003131310173 in words is "two hundred thirteen trillion, three billion, one hundred thirty-one million, three hundred ten thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •