Base | Representation |
---|---|
bin | 111011100000011011010000… |
… | …1000000010011001110010101 |
3 | 2112122022001011211022211200122 |
4 | 1313000312201000103032111 |
5 | 1022101303043033403431 |
6 | 5053122341155121325 |
7 | 215152166656601501 |
oct | 16700664100231625 |
9 | 2478261154284618 |
10 | 523426070606741 |
11 | 141863828193665 |
12 | 4a85758bba3245 |
13 | 1960ab360ab073 |
14 | 9337d57da7301 |
15 | 407a7a7570a7b |
hex | 1dc0da1013395 |
523426070606741 has 8 divisors (see below), whose sum is σ = 528618190981464. Its totient is φ = 518234140115200.
The previous prime is 523426070606717. The next prime is 523426070606749. The reversal of 523426070606741 is 147606070624325.
It can be written as a sum of positive squares in 4 ways, for example, as 99673347191716 + 423752723415025 = 9983654^2 + 20585255^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 523426070606741 - 226 = 523426003497877 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (523426070606749) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 41927120 + ... + 52959753.
It is an arithmetic number, because the mean of its divisors is an integer number (66077273872683).
Almost surely, 2523426070606741 is an apocalyptic number.
It is an amenable number.
523426070606741 is a deficient number, since it is larger than the sum of its proper divisors (5192120374723).
523426070606741 is a wasteful number, since it uses less digits than its factorization.
523426070606741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94941591.
The product of its (nonzero) digits is 10160640, while the sum is 53.
The spelling of 523426070606741 in words is "five hundred twenty-three trillion, four hundred twenty-six billion, seventy million, six hundred six thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •