Base | Representation |
---|---|
bin | 1100000111100101… |
… | …0011101100100000 |
3 | 22101201010211011110 |
4 | 3001321103230200 |
5 | 23130233304233 |
6 | 1254443343320 |
7 | 143420155362 |
oct | 30171235440 |
9 | 8351124143 |
10 | 3253025568 |
11 | 141a280291 |
12 | 769521b40 |
13 | 3cac46100 |
14 | 22c06cd32 |
15 | 1408c4663 |
hex | c1e53b20 |
3253025568 has 288 divisors, whose sum is σ = 9949988160. Its totient is φ = 927313920.
The previous prime is 3253025521. The next prime is 3253025591. The reversal of 3253025568 is 8655203523.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 18803530 + ... + 18803702.
It is an arithmetic number, because the mean of its divisors is an integer number (34548570).
Almost surely, 23253025568 is an apocalyptic number.
3253025568 is a gapful number since it is divisible by the number (38) 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 3253025568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4974994080).
3253025568 is an abundant number, since it is smaller than the sum of its proper divisors (6696962592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3253025568 is a wasteful number, since it uses less digits than its factorization.
3253025568 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 292 (or 271 counting only the distinct ones).
The product of its (nonzero) digits is 216000, while the sum is 39.
The square root of 3253025568 is about 57035.3010687241. The cubic root of 3253025568 is about 1481.7075446303.
The spelling of 3253025568 in words is "three billion, two hundred fifty-three million, twenty-five thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •