Base | Representation |
---|---|
bin | 1110100101010011011… |
… | …1101111000100000000 |
3 | 212221200000011020220222 |
4 | 3221110313233010000 |
5 | 13101042143000000 |
6 | 311032014122212 |
7 | 24046262602112 |
oct | 3512467570400 |
9 | 787600136828 |
10 | 250532000000 |
11 | 97282867777 |
12 | 4067a7b0368 |
13 | 1a8183693a9 |
14 | c1a93373b2 |
15 | 67b48a3a85 |
hex | 3a54def100 |
250532000000 has 126 divisors (see below), whose sum is σ = 625108678194. Its totient is φ = 100211200000.
The previous prime is 250531999997. The next prime is 250532000063. The reversal of 250532000000 is 235052.
It can be written as a sum of positive squares in 7 ways, for example, as 240586326016 + 9945673984 = 490496^2 + 99728^2 .
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 13 ways as a sum of consecutive naturals, for example, 3968684 + ... + 4031316.
Almost surely, 2250532000000 is an apocalyptic number.
250532000000 is a gapful number since it is divisible by the number (20) 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 250532000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (312554339097).
250532000000 is an abundant number, since it is smaller than the sum of its proper divisors (374576678194).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
250532000000 is an frugal number, since it uses more digits than its factorization.
250532000000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62679 (or 62640 counting only the distinct ones).
The product of its (nonzero) digits is 300, while the sum is 17.
Adding to 250532000000 its reverse (235052), we get a palindrome (250532235052).
The spelling of 250532000000 in words is "two hundred fifty billion, five hundred thirty-two million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •