Base | Representation |
---|---|
bin | 1111011100011001011… |
… | …01101000110000000110 |
3 | 1212201200100001221112220 |
4 | 13232030231220300012 |
5 | 32143223242013141 |
6 | 1043435022153210 |
7 | 53223540314451 |
oct | 7561455506006 |
9 | 1781610057486 |
10 | 530641751046 |
11 | 1950534865a0 |
12 | 86a12a22806 |
13 | 3b068469304 |
14 | 1b97c9a2498 |
15 | dc0ac75766 |
hex | 7b8cb68c06 |
530641751046 has 32 divisors (see below), whose sum is σ = 1157979753216. Its totient is φ = 160770540000.
The previous prime is 530641751041. The next prime is 530641751141. The reversal of 530641751046 is 640157146035.
It is a junction number, because it is equal to n+sod(n) for n = 530641750989 and 530641751007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (530641751041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 391930 + ... + 1102221.
It is an arithmetic number, because the mean of its divisors is an integer number (36186867288).
Almost surely, 2530641751046 is an apocalyptic number.
530641751046 is an abundant number, since it is smaller than the sum of its proper divisors (627338002170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
530641751046 is a wasteful number, since it uses less digits than its factorization.
530641751046 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1499548.
The product of its (nonzero) digits is 302400, while the sum is 42.
The spelling of 530641751046 in words is "five hundred thirty billion, six hundred forty-one million, seven hundred fifty-one thousand, forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •