Base | Representation |
---|---|
bin | 1111011100001001000… |
… | …00010110011111011101 |
3 | 1212201022201222001010100 |
4 | 13232010200112133131 |
5 | 32142433014110103 |
6 | 1043413222531313 |
7 | 53220246012543 |
oct | 7560440263735 |
9 | 1781281861110 |
10 | 530504050653 |
11 | 194a92785215 |
12 | 86994896b39 |
13 | 3b045a858a5 |
14 | 1b968599d93 |
15 | dbedb255a3 |
hex | 7b848167dd |
530504050653 has 12 divisors (see below), whose sum is σ = 773870596668. Its totient is φ = 350167689600.
The previous prime is 530504050649. The next prime is 530504050663. The reversal of 530504050653 is 356050405035.
530504050653 is a `hidden beast` number, since 53 + 0 + 50 + 4 + 0 + 506 + 53 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 502245768249 + 28258282404 = 708693^2 + 168102^2 .
It is not a de Polignac number, because 530504050653 - 22 = 530504050649 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (530504050663) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 291805500 + ... + 291807317.
It is an arithmetic number, because the mean of its divisors is an integer number (64489216389).
Almost surely, 2530504050653 is an apocalyptic number.
It is an amenable number.
530504050653 is a deficient number, since it is larger than the sum of its proper divisors (243366546015).
530504050653 is a wasteful number, since it uses less digits than its factorization.
530504050653 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 583612924 (or 583612921 counting only the distinct ones).
The product of its (nonzero) digits is 135000, while the sum is 36.
Adding to 530504050653 its reverse (356050405035), we get a palindrome (886554455688).
The spelling of 530504050653 in words is "five hundred thirty billion, five hundred four million, fifty thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •