Base | Representation |
---|---|
bin | 1100011010110100001… |
… | …1000010101011111111 |
3 | 202101201012011222022210 |
4 | 3012231003002223333 |
5 | 11443423300401221 |
6 | 242003101311503 |
7 | 21262114426134 |
oct | 3065503025377 |
9 | 671635158283 |
10 | 213356653311 |
11 | 825362a555a |
12 | 35424865593 |
13 | 17172566529 |
14 | a47dd6a58b |
15 | 583ad76276 |
hex | 31ad0c2aff |
213356653311 has 8 divisors (see below), whose sum is σ = 284543270704. Its totient is φ = 142203902400.
The previous prime is 213356653229. The next prime is 213356653327. The reversal of 213356653311 is 113356653312.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 213356653311 - 27 = 213356653183 is a prime.
It is a super-3 number, since 3×2133566533113 (a number of 35 digits) contains 333 as substring.
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 213356653311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213356653381) 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, 8451916 + ... + 8477121.
It is an arithmetic number, because the mean of its divisors is an integer number (35567908838).
Almost surely, 2213356653311 is an apocalyptic number.
213356653311 is a deficient number, since it is larger than the sum of its proper divisors (71186617393).
213356653311 is a wasteful number, since it uses less digits than its factorization.
213356653311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16933241.
The product of its digits is 145800, while the sum is 39.
Subtracting from 213356653311 its reverse (113356653312), we obtain a palindrome (99999999999).
The spelling of 213356653311 in words is "two hundred thirteen billion, three hundred fifty-six million, six hundred fifty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •