Base | Representation |
---|---|
bin | 110000011110101000011001… |
… | …111110000101010101100111 |
3 | 1000221220210101021100122222100 |
4 | 300132220121332011111213 |
5 | 210421223020231310343 |
6 | 2033243512450303143 |
7 | 62624000231302044 |
oct | 6036503176052547 |
9 | 1027823337318870 |
10 | 213211202213223 |
11 | 61a323aa2768a5 |
12 | 1bab5914287ab3 |
13 | 91c79650415a6 |
14 | 3a916977d81cb |
15 | 199b1a537e9d3 |
hex | c1ea19f85567 |
213211202213223 has 24 divisors (see below), whose sum is σ = 308131500353040. Its totient is φ = 142067074596480.
The previous prime is 213211202213209. The next prime is 213211202213239. The reversal of 213211202213223 is 322312202112312.
213211202213223 is a `hidden beast` number, since 2 + 1 + 3 + 2 + 112 + 0 + 221 + 322 + 3 = 666.
It is not a de Polignac number, because 213211202213223 - 221 = 213211200116071 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213211202213203) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 253022368 + ... + 253863626.
It is an arithmetic number, because the mean of its divisors is an integer number (12838812514710).
Almost surely, 2213211202213223 is an apocalyptic number.
213211202213223 is a deficient number, since it is larger than the sum of its proper divisors (94920298139817).
213211202213223 is a wasteful number, since it uses less digits than its factorization.
213211202213223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 855839 (or 855836 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 213211202213223 its reverse (322312202112312), we get a palindrome (535523404325535).
The spelling of 213211202213223 in words is "two hundred thirteen trillion, two hundred eleven billion, two hundred two million, two hundred thirteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •