Base | Representation |
---|---|
bin | 111100010100101101011110… |
… | …1011001100100111010100101 |
3 | 2120120202000101111120122022222 |
4 | 1320221122331121210322211 |
5 | 1024022021412440443221 |
6 | 5120303444501402125 |
7 | 216523311453531365 |
oct | 17051327531447245 |
9 | 2516660344518288 |
10 | 530612027281061 |
11 | 14408432a411720 |
12 | 4b6181ba409345 |
13 | 19a0c66545749b |
14 | 9505a8b16a9a5 |
15 | 41526833a39ab |
hex | 1e296bd664ea5 |
530612027281061 has 8 divisors (see below), whose sum is σ = 579784620799200. Its totient is φ = 481595289845040.
The previous prime is 530612027281013. The next prime is 530612027281069. The reversal of 530612027281061 is 160182720216035.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-530612027281061 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (530612027281069) 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, 38964013406 + ... + 38964027023.
It is an arithmetic number, because the mean of its divisors is an integer number (72473077599900).
Almost surely, 2530612027281061 is an apocalyptic number.
It is an amenable number.
530612027281061 is a deficient number, since it is larger than the sum of its proper divisors (49172593518139).
530612027281061 is a wasteful number, since it uses less digits than its factorization.
530612027281061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77928041059.
The product of its (nonzero) digits is 241920, while the sum is 44.
Adding to 530612027281061 its reverse (160182720216035), we get a palindrome (690794747497096).
The spelling of 530612027281061 in words is "five hundred thirty trillion, six hundred twelve billion, twenty-seven million, two hundred eighty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •