Base | Representation |
---|---|
bin | 1101101001100101… |
… | …0100111010001000 |
3 | 100110100121011022112 |
4 | 3122121110322020 |
5 | 30001000303303 |
6 | 1403325441452 |
7 | 156541046420 |
oct | 33231247210 |
9 | 10410534275 |
10 | 3664072328 |
11 | 1610300854 |
12 | 863110288 |
13 | 465154847 |
14 | 26a8ab480 |
15 | 166a1b0d8 |
hex | da654e88 |
3664072328 has 64 divisors (see below), whose sum is σ = 8357904000. Its totient is φ = 1470915072.
The previous prime is 3664072327. The next prime is 3664072331. The reversal of 3664072328 is 8232704663.
It is not an unprimeable number, because it can be changed into a prime (3664072327) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 75350 + ... + 114042.
It is an arithmetic number, because the mean of its divisors is an integer number (130592250).
Almost surely, 23664072328 is an apocalyptic number.
3664072328 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 3664072328, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4178952000).
3664072328 is an abundant number, since it is smaller than the sum of its proper divisors (4693831672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3664072328 is a wasteful number, since it uses less digits than its factorization.
3664072328 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38814 (or 38810 counting only the distinct ones).
The product of its (nonzero) digits is 290304, while the sum is 41.
The square root of 3664072328 is about 60531.5812448345. The cubic root of 3664072328 is about 1541.6578996972.
The spelling of 3664072328 in words is "three billion, six hundred sixty-four million, seventy-two thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •