Base | Representation |
---|---|
bin | 1100000110111111… |
… | …0100010000011100 |
3 | 22101112110102011210 |
4 | 3001233310100130 |
5 | 23124114200000 |
6 | 1254314144420 |
7 | 143360053500 |
oct | 30157642034 |
9 | 8345412153 |
10 | 3250537500 |
11 | 1418930a31 |
12 | 768722110 |
13 | 3ca584792 |
14 | 22b9c2300 |
15 | 140582350 |
hex | c1bf441c |
3250537500 has 432 divisors, whose sum is σ = 11595195360. Its totient is φ = 705600000.
The previous prime is 3250537481. The next prime is 3250537553. The reversal of 3250537500 is 57350523.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 53287470 + ... + 53287530.
It is an arithmetic number, because the mean of its divisors is an integer number (26840730).
Almost surely, 23250537500 is an apocalyptic number.
3250537500 is a gapful number since it is divisible by the number (30) 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 3250537500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5797597680).
3250537500 is an abundant number, since it is smaller than the sum of its proper divisors (8344657860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3250537500 is a wasteful number, since it uses less digits than its factorization.
3250537500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136 (or 107 counting only the distinct ones).
The product of its (nonzero) digits is 15750, while the sum is 30.
The square root of 3250537500 is about 57013.4852469133. The cubic root of 3250537500 is about 1481.3296882479.
The spelling of 3250537500 in words is "three billion, two hundred fifty million, five hundred thirty-seven thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •