Base | Representation |
---|---|
bin | 1111011011101010111… |
… | …00000000100100100011 |
3 | 1212200200010021122101020 |
4 | 13231311130000210203 |
5 | 32141423310112201 |
6 | 1043332152340523 |
7 | 53211056202321 |
oct | 7556534004443 |
9 | 1780603248336 |
10 | 530251254051 |
11 | 194973011402 |
12 | 869240a4743 |
13 | 3b0055a42bc |
14 | 1b942b92d11 |
15 | dbd683ca36 |
hex | 7b75700923 |
530251254051 has 16 divisors (see below), whose sum is σ = 715166462880. Its totient is φ = 349420896000.
The previous prime is 530251254037. The next prime is 530251254067. The reversal of 530251254051 is 150452152035.
It is not a de Polignac number, because 530251254051 - 25 = 530251254019 is a prime.
It is not an unprimeable number, because it can be changed into a prime (530251254031) 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, 563301 + ... + 1173801.
It is an arithmetic number, because the mean of its divisors is an integer number (44697903930).
Almost surely, 2530251254051 is an apocalyptic number.
530251254051 is a deficient number, since it is larger than the sum of its proper divisors (184915208829).
530251254051 is a wasteful number, since it uses less digits than its factorization.
530251254051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 613846.
The product of its (nonzero) digits is 30000, while the sum is 33.
The spelling of 530251254051 in words is "five hundred thirty billion, two hundred fifty-one million, two hundred fifty-four thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •