Base | Representation |
---|---|
bin | 1111011011101001110… |
… | …10110001001100011001 |
3 | 1212200122111212221101012 |
4 | 13231310322301030121 |
5 | 32141414042242223 |
6 | 1043331241503305 |
7 | 53210622140663 |
oct | 7556472611431 |
9 | 1780574787335 |
10 | 530242540313 |
11 | 1949690aa672 |
12 | 869211a1b35 |
13 | 3b003843045 |
14 | 1b941965533 |
15 | dbd5bbac78 |
hex | 7b74eb1319 |
530242540313 has 2 divisors, whose sum is σ = 530242540314. Its totient is φ = 530242540312.
The previous prime is 530242540307. The next prime is 530242540343. The reversal of 530242540313 is 313045242035.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 415763171209 + 114479369104 = 644797^2 + 338348^2 .
It is a cyclic number.
It is not a de Polignac number, because 530242540313 - 220 = 530241491737 is a prime.
It is a super-3 number, since 3×5302425403133 (a number of 36 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 530242540313.
It is not a weakly prime, because it can be changed into another prime (530242540343) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 265121270156 + 265121270157.
It is an arithmetic number, because the mean of its divisors is an integer number (265121270157).
Almost surely, 2530242540313 is an apocalyptic number.
It is an amenable number.
530242540313 is a deficient number, since it is larger than the sum of its proper divisors (1).
530242540313 is an equidigital number, since it uses as much as digits as its factorization.
530242540313 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 43200, while the sum is 32.
Adding to 530242540313 its reverse (313045242035), we get a palindrome (843287782348).
The spelling of 530242540313 in words is "five hundred thirty billion, two hundred forty-two million, five hundred forty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •