Base | Representation |
---|---|
bin | 1111011011101011000… |
… | …11100100010001101111 |
3 | 1212200200021000022011020 |
4 | 13231311203210101233 |
5 | 32141424312012221 |
6 | 1043332303025223 |
7 | 53211112063512 |
oct | 7556543442157 |
9 | 1780607008136 |
10 | 530253235311 |
11 | 194974144a08 |
12 | 8692489b213 |
13 | 3b005b19047 |
14 | 1b94314ad79 |
15 | dbd6aceac6 |
hex | 7b758e446f |
530253235311 has 8 divisors (see below), whose sum is σ = 748592802864. Its totient is φ = 332707912320.
The previous prime is 530253235297. The next prime is 530253235469. The reversal of 530253235311 is 113532352035.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 530253235311 - 29 = 530253234799 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (530253735311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5198561080 + ... + 5198561181.
It is an arithmetic number, because the mean of its divisors is an integer number (93574100358).
Almost surely, 2530253235311 is an apocalyptic number.
530253235311 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
530253235311 is a deficient number, since it is larger than the sum of its proper divisors (218339567553).
530253235311 is a wasteful number, since it uses less digits than its factorization.
530253235311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10397122281.
The product of its (nonzero) digits is 40500, while the sum is 33.
Adding to 530253235311 its reverse (113532352035), we get a palindrome (643785587346).
The spelling of 530253235311 in words is "five hundred thirty billion, two hundred fifty-three million, two hundred thirty-five thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •