Base | Representation |
---|---|
bin | 1100010001101110… |
… | …1110001001010000 |
3 | 22111200020212222220 |
4 | 3010123232021100 |
5 | 23222133214412 |
6 | 1303004101040 |
7 | 144445101600 |
oct | 30433561120 |
9 | 8450225886 |
10 | 3295601232 |
11 | 144130aa90 |
12 | 77b834780 |
13 | 406a02101 |
14 | 233992c00 |
15 | 1444d468c |
hex | c46ee250 |
3295601232 has 480 divisors, whose sum is σ = 11724963840. Its totient is φ = 785756160.
The previous prime is 3295601219. The next prime is 3295601251. The reversal of 3295601232 is 2321065923.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 3295601193 and 3295601202.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 25949553 + ... + 25949679.
It is an arithmetic number, because the mean of its divisors is an integer number (24427008).
Almost surely, 23295601232 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 3295601232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5862481920).
3295601232 is an abundant number, since it is smaller than the sum of its proper divisors (8429362608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3295601232 is a wasteful number, since it uses less digits than its factorization.
3295601232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 239 (or 226 counting only the distinct ones).
The product of its (nonzero) digits is 19440, while the sum is 33.
The square root of 3295601232 is about 57407.3273371963. The cubic root of 3295601232 is about 1488.1437527323.
The spelling of 3295601232 in words is "three billion, two hundred ninety-five million, six hundred one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •