Base | Representation |
---|---|
bin | 110000011011111000111010… |
… | …001111100100000001100101 |
3 | 1000221020202222202200202102022 |
4 | 300123320322033210001211 |
5 | 210410131110331332003 |
6 | 2033021150213152525 |
7 | 62604246463305365 |
oct | 6033707217440145 |
9 | 1027222882622368 |
10 | 213022765105253 |
11 | 6196a4a1456614 |
12 | 1ba852a502b745 |
13 | 91b2c6445227c |
14 | 3a864dd2709a5 |
15 | 19963270d7738 |
hex | c1be3a3e4065 |
213022765105253 has 8 divisors (see below), whose sum is σ = 216633567938400. Its totient is φ = 209411970521968.
The previous prime is 213022765105151. The next prime is 213022765105259. The reversal of 213022765105253 is 352501567220312.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 213022765105253 - 28 = 213022765104997 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213022765105259) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 72937850 + ... + 75802212.
It is an arithmetic number, because the mean of its divisors is an integer number (27079195992300).
Almost surely, 2213022765105253 is an apocalyptic number.
It is an amenable number.
213022765105253 is a deficient number, since it is larger than the sum of its proper divisors (3610802833147).
213022765105253 is a wasteful number, since it uses less digits than its factorization.
213022765105253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4124931.
The product of its (nonzero) digits is 756000, while the sum is 44.
The spelling of 213022765105253 in words is "two hundred thirteen trillion, twenty-two billion, seven hundred sixty-five million, one hundred five thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •