Base | Representation |
---|---|
bin | 111010110011010110000000… |
… | …0010000000000111100010101 |
3 | 2111211100201010011012220110022 |
4 | 1311212230000100000330111 |
5 | 1020243244100333103212 |
6 | 5032020110145434525 |
7 | 213642431223042662 |
oct | 16546540020007425 |
9 | 2454321104186408 |
10 | 517230030753557 |
11 | 13a89502a223a20 |
12 | 4a01678a93ba45 |
13 | 1927b776008a54 |
14 | 91a20d2034a69 |
15 | 3ebe517b65772 |
hex | 1d66b00400f15 |
517230030753557 has 32 divisors (see below), whose sum is σ = 570446715231360. Its totient is φ = 465071742720000.
The previous prime is 517230030753547. The next prime is 517230030753649. The reversal of 517230030753557 is 755357030032715.
It is a cyclic number.
It is not a de Polignac number, because 517230030753557 - 26 = 517230030753493 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 517230030753499 and 517230030753508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (517230030753547) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 700552169 + ... + 701290097.
It is an arithmetic number, because the mean of its divisors is an integer number (17826459850980).
Almost surely, 2517230030753557 is an apocalyptic number.
It is an amenable number.
517230030753557 is a deficient number, since it is larger than the sum of its proper divisors (53216684477803).
517230030753557 is a wasteful number, since it uses less digits than its factorization.
517230030753557 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 739685.
The product of its (nonzero) digits is 11576250, while the sum is 53.
The spelling of 517230030753557 in words is "five hundred seventeen trillion, two hundred thirty billion, thirty million, seven hundred fifty-three thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •