Base | Representation |
---|---|
bin | 1111001001000001110… |
… | …10100000001101010000 |
3 | 1211201211122110100202112 |
4 | 13210200322200031100 |
5 | 32010424233000000 |
6 | 1034555122204452 |
7 | 52405053443045 |
oct | 7444072401520 |
9 | 1751748410675 |
10 | 520243250000 |
11 | 1906a782a881 |
12 | 849b04b3728 |
13 | 3a09c043906 |
14 | 1b2739491cc |
15 | d7ecded235 |
hex | 7920ea0350 |
520243250000 has 140 divisors (see below), whose sum is σ = 1265365053120. Its totient is φ = 207202800000.
The previous prime is 520243249969. The next prime is 520243250011. The reversal of 520243250000 is 52342025.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 59745647 + ... + 59754353.
It is an arithmetic number, because the mean of its divisors is an integer number (9038321808).
Almost surely, 2520243250000 is an apocalyptic number.
520243250000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 520243250000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (632682526560).
520243250000 is an abundant number, since it is smaller than the sum of its proper divisors (745121803120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
520243250000 is an frugal number, since it uses more digits than its factorization.
520243250000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8984 (or 8953 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 23.
Adding to 520243250000 its reverse (52342025), we get a palindrome (520295592025).
The spelling of 520243250000 in words is "five hundred twenty billion, two hundred forty-three million, two hundred fifty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •