Base | Representation |
---|---|
bin | 111100010011111011101001… |
… | …0110110111101110000001110 |
3 | 2120120100210011111120012121111 |
4 | 1320213313102312331300032 |
5 | 1024013243231324432420 |
6 | 5120142345532522234 |
7 | 216512502526311613 |
oct | 17047672266756016 |
9 | 2516323144505544 |
10 | 530505013124110 |
11 | 144042a047426a2 |
12 | 4b5bb51362037a |
13 | 19a0253c72611b |
14 | 950081874650a |
15 | 414e9bd4a545a |
hex | 1e27dd2dbdc0e |
530505013124110 has 16 divisors (see below), whose sum is σ = 961232924444832. Its totient is φ = 210796693956000.
The previous prime is 530505013124071. The next prime is 530505013124111. The reversal of 530505013124110 is 11421310505035.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (530505013124111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 175663910121 + ... + 175663913140.
It is an arithmetic number, because the mean of its divisors is an integer number (60077057777802).
Almost surely, 2530505013124110 is an apocalyptic number.
530505013124110 is a deficient number, since it is larger than the sum of its proper divisors (430727911320722).
530505013124110 is a wasteful number, since it uses less digits than its factorization.
530505013124110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 351327823419.
The product of its (nonzero) digits is 9000, while the sum is 31.
Adding to 530505013124110 its reverse (11421310505035), we get a palindrome (541926323629145).
The spelling of 530505013124110 in words is "five hundred thirty trillion, five hundred five billion, thirteen million, one hundred twenty-four thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •