Base | Representation |
---|---|
bin | 101101111101011000100001… |
… | …111011110100010011100111 |
3 | 222111200110200112221200010022 |
4 | 231331120201323310103213 |
5 | 202443200343433310343 |
6 | 1553521215344545355 |
7 | 60401301523334303 |
oct | 5575304173642347 |
9 | 874613615850108 |
10 | 202130320213223 |
11 | 5944aa95263196 |
12 | 1a80626332225b |
13 | 88a2a65b5204c |
14 | 37cb2342d4d03 |
15 | 1857d18083568 |
hex | b7d621ef44e7 |
202130320213223 has 16 divisors (see below), whose sum is σ = 205128301284000. Its totient is φ = 199148523087360.
The previous prime is 202130320213201. The next prime is 202130320213231. The reversal of 202130320213223 is 322312023031202.
It is a cyclic number.
It is not a de Polignac number, because 202130320213223 - 216 = 202130320147687 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 202130320213192 and 202130320213201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202130320210223) 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, 2128782953 + ... + 2128877901.
It is an arithmetic number, because the mean of its divisors is an integer number (12820518830250).
Almost surely, 2202130320213223 is an apocalyptic number.
202130320213223 is a deficient number, since it is larger than the sum of its proper divisors (2997981070777).
202130320213223 is an equidigital number, since it uses as much as digits as its factorization.
202130320213223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 179842.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 202130320213223 its reverse (322312023031202), we get a palindrome (524442343244425).
The spelling of 202130320213223 in words is "two hundred two trillion, one hundred thirty billion, three hundred twenty million, two hundred thirteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •