Base | Representation |
---|---|
bin | 101110101110101101101001… |
… | …000010011010001010110011 |
3 | 222221200112200001110022002120 |
4 | 232232231221002122022303 |
5 | 203414220424013220201 |
6 | 2005034410152245323 |
7 | 61201230123660561 |
oct | 5656555102321263 |
9 | 887615601408076 |
10 | 205520242320051 |
11 | 5a537710984a2a |
12 | 1b0732493a0843 |
13 | 8a8a62512c689 |
14 | 38a7338b52a31 |
15 | 18b60be578536 |
hex | baeb6909a2b3 |
205520242320051 has 8 divisors (see below), whose sum is σ = 275667869938944. Its totient is φ = 136193054790600.
The previous prime is 205520242319969. The next prime is 205520242320067. The reversal of 205520242320051 is 150023242025502.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 205520242320051 - 210 = 205520242319027 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 205520242319994 and 205520242320021.
It is not an unprimeable number, because it can be changed into a prime (205520242320091) 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, 205110021775 + ... + 205110022776.
It is an arithmetic number, because the mean of its divisors is an integer number (34458483742368).
Almost surely, 2205520242320051 is an apocalyptic number.
205520242320051 is a deficient number, since it is larger than the sum of its proper divisors (70147627618893).
205520242320051 is a wasteful number, since it uses less digits than its factorization.
205520242320051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 410220044721.
The product of its (nonzero) digits is 48000, while the sum is 33.
Adding to 205520242320051 its reverse (150023242025502), we get a palindrome (355543484345553).
The spelling of 205520242320051 in words is "two hundred five trillion, five hundred twenty billion, two hundred forty-two million, three hundred twenty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •