Base | Representation |
---|---|
bin | 111100010001010110100100… |
… | …1110011100101111000101010 |
3 | 2120112002220011201022222212221 |
4 | 1320202231021303211320222 |
5 | 1023441441234232134200 |
6 | 5115311442321024254 |
7 | 216445053156244552 |
oct | 17042551163457052 |
9 | 2515086151288787 |
10 | 530150526443050 |
11 | 143a166371aa477 |
12 | 4b56288278508a |
13 | 199a7c98465446 |
14 | 94cb5cb074162 |
15 | 41456725e491a |
hex | 1e22b49ce5e2a |
530150526443050 has 96 divisors (see below), whose sum is σ = 993465711000000. Its totient is φ = 210474161233920.
The previous prime is 530150526442993. The next prime is 530150526443119. The reversal of 530150526443050 is 50344625051035.
It is a junction number, because it is equal to n+sod(n) for n = 530150526442988 and 530150526443006.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 81199342186 + ... + 81199348714.
It is an arithmetic number, because the mean of its divisors is an integer number (10348601156250).
Almost surely, 2530150526443050 is an apocalyptic number.
530150526443050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
530150526443050 is a deficient number, since it is larger than the sum of its proper divisors (463315184556950).
530150526443050 is a wasteful number, since it uses less digits than its factorization.
530150526443050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13448 (or 13443 counting only the distinct ones).
The product of its (nonzero) digits is 1080000, while the sum is 43.
The spelling of 530150526443050 in words is "five hundred thirty trillion, one hundred fifty billion, five hundred twenty-six million, four hundred forty-three thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •