Base | Representation |
---|---|
bin | 1011111100011111011… |
… | …0010000000001111101 |
3 | 201121200212202201220220 |
4 | 2333013312100001331 |
5 | 11330240341202313 |
6 | 234135230331553 |
7 | 20553311124321 |
oct | 2770766200175 |
9 | 647625681826 |
10 | 205216350333 |
11 | 7a039309435 |
12 | 33932659bb9 |
13 | 16475c3b1c7 |
14 | 9d0abbd981 |
15 | 55113b4823 |
hex | 2fc7d9007d |
205216350333 has 8 divisors (see below), whose sum is σ = 273882148896. Its totient is φ = 136680726000.
The previous prime is 205216350293. The next prime is 205216350341. The reversal of 205216350333 is 333053612502.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 205216350333 - 28 = 205216350077 is a prime.
It is a super-2 number, since 2×2052163503332 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 205216350294 and 205216350303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (205216350373) 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, 32539878 + ... + 32546183.
It is an arithmetic number, because the mean of its divisors is an integer number (34235268612).
Almost surely, 2205216350333 is an apocalyptic number.
It is an amenable number.
205216350333 is a deficient number, since it is larger than the sum of its proper divisors (68665798563).
205216350333 is a wasteful number, since it uses less digits than its factorization.
205216350333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65087115.
The product of its (nonzero) digits is 48600, while the sum is 33.
Adding to 205216350333 its reverse (333053612502), we get a palindrome (538269962835).
The spelling of 205216350333 in words is "two hundred five billion, two hundred sixteen million, three hundred fifty thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •