Base | Representation |
---|---|
bin | 1111001000110100100… |
… | …01001001010000000000 |
3 | 1211201112212122022100010 |
4 | 13210122101021100000 |
5 | 32010212211313033 |
6 | 1034540100224520 |
7 | 52402230611646 |
oct | 7443221112000 |
9 | 1751485568303 |
10 | 520131744768 |
11 | 19064a8a0299 |
12 | 8497b09b140 |
13 | 3a081c0239c |
14 | 1b262c01196 |
15 | d7e3224863 |
hex | 791a449400 |
520131744768 has 88 divisors (see below), whose sum is σ = 1387534222240. Its totient is φ = 173227991040.
The previous prime is 520131744767. The next prime is 520131744799. The reversal of 520131744768 is 867447131025.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (520131744767) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3525018 + ... + 3669606.
Almost surely, 2520131744768 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 520131744768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (693767111120).
520131744768 is an abundant number, since it is smaller than the sum of its proper divisors (867402477472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
520131744768 is a wasteful number, since it uses less digits than its factorization.
520131744768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145783 (or 145765 counting only the distinct ones).
The product of its (nonzero) digits is 1128960, while the sum is 48.
The spelling of 520131744768 in words is "five hundred twenty billion, one hundred thirty-one million, seven hundred forty-four thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •