Base | Representation |
---|---|
bin | 111011011110010000100110… |
… | …0100001101010101111001001 |
3 | 2112121020120120201102111221010 |
4 | 1312330201030201222233021 |
5 | 1022031413224420001032 |
6 | 5052333453521234133 |
7 | 215121525650054544 |
oct | 16674411441525711 |
9 | 2477216521374833 |
10 | 523128300547017 |
11 | 141759514806510 |
12 | 4a809929492949 |
13 | 195b8a30264859 |
14 | 932778b09785b |
15 | 4072b7aa44ccc |
hex | 1dbc84c86abc9 |
523128300547017 has 16 divisors (see below), whose sum is σ = 800961991269120. Its totient is φ = 300360746725200.
The previous prime is 523128300547009. The next prime is 523128300547031. The reversal of 523128300547017 is 710745003821325.
It is not a de Polignac number, because 523128300547017 - 23 = 523128300547009 is a prime.
It is a super-2 number, since 2×5231283005470172 (a number of 30 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (523128300547057) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 417167703159 + ... + 417167704412.
It is an arithmetic number, because the mean of its divisors is an integer number (50060124454320).
Almost surely, 2523128300547017 is an apocalyptic number.
523128300547017 is a gapful number since it is divisible by the number (57) formed by its first and last digit.
It is an amenable number.
523128300547017 is a deficient number, since it is larger than the sum of its proper divisors (277833690722103).
523128300547017 is a wasteful number, since it uses less digits than its factorization.
523128300547017 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 834335407604.
The product of its (nonzero) digits is 1411200, while the sum is 48.
The spelling of 523128300547017 in words is "five hundred twenty-three trillion, one hundred twenty-eight billion, three hundred million, five hundred forty-seven thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •