Base | Representation |
---|---|
bin | 1100011011011011111… |
… | …0011000100011101011 |
3 | 202102010210120122101002 |
4 | 3012312332120203223 |
5 | 11444243420014311 |
6 | 242031411145215 |
7 | 21266206201463 |
oct | 3066676304353 |
9 | 672123518332 |
10 | 213523204331 |
11 | 82611311828 |
12 | 354705a520b |
13 | 1719ac0ba28 |
14 | a498122ba3 |
15 | 584a7c493b |
hex | 31b6f988eb |
213523204331 has 8 divisors (see below), whose sum is σ = 220492800000. Its totient is φ = 206558718120.
The previous prime is 213523204291. The next prime is 213523204343. The reversal of 213523204331 is 133402325312.
It is a happy number.
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 213523204331 - 26 = 213523204267 is a prime.
It is a super-2 number, since 2×2135232043312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 213523204294 and 213523204303.
It is not an unprimeable number, because it can be changed into a prime (213523204931) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1192331 + ... + 1359668.
It is an arithmetic number, because the mean of its divisors is an integer number (27561600000).
Almost surely, 2213523204331 is an apocalyptic number.
213523204331 is a deficient number, since it is larger than the sum of its proper divisors (6969595669).
213523204331 is a wasteful number, since it uses less digits than its factorization.
213523204331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2554729.
The product of its (nonzero) digits is 12960, while the sum is 29.
Adding to 213523204331 its reverse (133402325312), we get a palindrome (346925529643).
The spelling of 213523204331 in words is "two hundred thirteen billion, five hundred twenty-three million, two hundred four thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •