Base | Representation |
---|---|
bin | 1111011011100110000… |
… | …00101111001011101111 |
3 | 1212200120021200200121201 |
4 | 13231303000233023233 |
5 | 32141332400104021 |
6 | 1043324140110331 |
7 | 53210053214155 |
oct | 7556300571357 |
9 | 1780507620551 |
10 | 530210550511 |
11 | 194952040214 |
12 | 869125353a7 |
13 | 3acca022475 |
14 | 1b93b5d93d5 |
15 | dbd2e9c591 |
hex | 7b7302f2ef |
530210550511 has 4 divisors (see below), whose sum is σ = 535460160024. Its totient is φ = 524960941000.
The previous prime is 530210550481. The next prime is 530210550539. The reversal of 530210550511 is 115055012035.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 530210550511 - 223 = 530202161903 is a prime.
It is a super-2 number, since 2×5302105505112 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 530210550511.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (530210553511) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2624804605 + ... + 2624804806.
It is an arithmetic number, because the mean of its divisors is an integer number (133865040006).
Almost surely, 2530210550511 is an apocalyptic number.
530210550511 is a deficient number, since it is larger than the sum of its proper divisors (5249609513).
530210550511 is a wasteful number, since it uses less digits than its factorization.
530210550511 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5249609512.
The product of its (nonzero) digits is 3750, while the sum is 28.
Adding to 530210550511 its reverse (115055012035), we get a palindrome (645265562546).
The spelling of 530210550511 in words is "five hundred thirty billion, two hundred ten million, five hundred fifty thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •