Base | Representation |
---|---|
bin | 1110101110111000010… |
… | …11101001001010110001 |
3 | 1210101121022102012201121 |
4 | 13113130023221022301 |
5 | 31243202013311421 |
6 | 1024314130302241 |
7 | 51400144214401 |
oct | 7273413511261 |
9 | 1711538365647 |
10 | 506205213361 |
11 | 185753712101 |
12 | 82133127981 |
13 | 389728a7a63 |
14 | 1a7013b0801 |
15 | d27a7a4d41 |
hex | 75dc2e92b1 |
506205213361 has 27 divisors (see below), whose sum is σ = 533448190443. Its totient is φ = 480335052720.
The previous prime is 506205213341. The next prime is 506205213373. The reversal of 506205213361 is 163312502605.
The square root of 506205213361 is 711481.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 119495353761 + 386709859600 = 345681^2 + 621860^2 .
It is not a de Polignac number, because 506205213361 - 213 = 506205205169 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (506205213341) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 1301298555 + ... + 1301298943.
Almost surely, 2506205213361 is an apocalyptic number.
506205213361 is the 711481-st square number.
506205213361 is the 355741-st centered octagonal number.
It is an amenable number.
506205213361 is a deficient number, since it is larger than the sum of its proper divisors (27242977082).
506205213361 is an frugal number, since it uses more digits than its factorization.
506205213361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 958 (or 479 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 34.
Adding to 506205213361 its reverse (163312502605), we get a palindrome (669517715966).
The spelling of 506205213361 in words is "five hundred six billion, two hundred five million, two hundred thirteen thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •