Base | Representation |
---|---|
bin | 1100011011100000010… |
… | …0010000101100101111 |
3 | 202102012002001021210112 |
4 | 3012320010100230233 |
5 | 11444313112202343 |
6 | 242033303530235 |
7 | 21266520663431 |
oct | 3067004205457 |
9 | 672162037715 |
10 | 213541522223 |
11 | 82620693287 |
12 | 3547675997b |
13 | 171a1953613 |
14 | a49a730651 |
15 | 584c1e2218 |
hex | 31b8110b2f |
213541522223 has 4 divisors (see below), whose sum is σ = 213542767680. Its totient is φ = 213540276768.
The previous prime is 213541522213. The next prime is 213541522297. The reversal of 213541522223 is 322225145312.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 213541522223 - 220 = 213540473647 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 213541522223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213541522213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 314783 + ... + 725376.
It is an arithmetic number, because the mean of its divisors is an integer number (53385691920).
Almost surely, 2213541522223 is an apocalyptic number.
213541522223 is a deficient number, since it is larger than the sum of its proper divisors (1245457).
213541522223 is a wasteful number, since it uses less digits than its factorization.
213541522223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1245456.
The product of its digits is 28800, while the sum is 32.
Adding to 213541522223 its reverse (322225145312), we get a palindrome (535766667535).
The spelling of 213541522223 in words is "two hundred thirteen billion, five hundred forty-one million, five hundred twenty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •