Base | Representation |
---|---|
bin | 110000011101010101101110… |
… | …001001100101101100111111 |
3 | 1000221121022012220100012202200 |
4 | 300131111232021211230333 |
5 | 210413244204032433203 |
6 | 2033135031015522543 |
7 | 62614405151536053 |
oct | 6035255611455477 |
9 | 1027538186305680 |
10 | 213122420202303 |
11 | 619a8790128a57 |
12 | 1baa0677389453 |
13 | 91bc486671811 |
14 | 3a8b27458dc63 |
15 | 1998c0ade39a3 |
hex | c1d56e265b3f |
213122420202303 has 12 divisors (see below), whose sum is σ = 307879254293520. Its totient is φ = 142065109570176.
The previous prime is 213122420202283. The next prime is 213122420202371. The reversal of 213122420202303 is 303202024221312.
213122420202303 is a `hidden beast` number, since 2 + 1 + 3 + 1 + 2 + 2 + 420 + 2 + 0 + 230 + 3 = 666.
It is not a de Polignac number, because 213122420202303 - 213 = 213122420194111 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213122420201303) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1375243051 + ... + 1375398012.
It is an arithmetic number, because the mean of its divisors is an integer number (25656604524460).
Almost surely, 2213122420202303 is an apocalyptic number.
213122420202303 is a deficient number, since it is larger than the sum of its proper divisors (94756834091217).
213122420202303 is a wasteful number, since it uses less digits than its factorization.
213122420202303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2750649678 (or 2750649675 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
Adding to 213122420202303 its reverse (303202024221312), we get a palindrome (516324444423615).
The spelling of 213122420202303 in words is "two hundred thirteen trillion, one hundred twenty-two billion, four hundred twenty million, two hundred two thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •