Base | Representation |
---|---|
bin | 101110101001000010001110… |
… | …110101111100010011011001 |
3 | 222220022020110210201101010022 |
4 | 232221002032311330103121 |
5 | 203341322302321443030 |
6 | 2004135234214000225 |
7 | 61131104324523641 |
oct | 5651021665742331 |
9 | 886266423641108 |
10 | 205130034562265 |
11 | 5a3a718286609a |
12 | 1b00b6a9646075 |
13 | 8a5c8aa4393c7 |
14 | 38924bd2b1521 |
15 | 18aad8269ede5 |
hex | ba908ed7c4d9 |
205130034562265 has 8 divisors (see below), whose sum is σ = 246479505397128. Its totient is φ = 163888385034880.
The previous prime is 205130034562181. The next prime is 205130034562289. The reversal of 205130034562265 is 562265430031502.
It can be written as a sum of positive squares in 4 ways, for example, as 26571303229696 + 178558731332569 = 5154736^2 + 13362587^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-205130034562265 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26955322682 + ... + 26955330291.
It is an arithmetic number, because the mean of its divisors is an integer number (30809938174641).
Almost surely, 2205130034562265 is an apocalyptic number.
It is an amenable number.
205130034562265 is a deficient number, since it is larger than the sum of its proper divisors (41349470834863).
205130034562265 is an equidigital number, since it uses as much as digits as its factorization.
205130034562265 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53910653739.
The product of its (nonzero) digits is 1296000, while the sum is 44.
Adding to 205130034562265 its reverse (562265430031502), we get a palindrome (767395464593767).
The spelling of 205130034562265 in words is "two hundred five trillion, one hundred thirty billion, thirty-four million, five hundred sixty-two thousand, two hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •