Base | Representation |
---|---|
bin | 1011101010110001… |
… | …1011100001110100 |
3 | 22002021210201100200 |
4 | 2322230123201310 |
5 | 22403321144033 |
6 | 1234450040500 |
7 | 140422224306 |
oct | 27254334164 |
9 | 8067721320 |
10 | 3132209268 |
11 | 1368061201 |
12 | 734b79130 |
13 | 3abbc4786 |
14 | 219dbd976 |
15 | 134eac013 |
hex | bab1b874 |
3132209268 has 144 divisors (see below), whose sum is σ = 8790477696. Its totient is φ = 936069120.
The previous prime is 3132209257. The next prime is 3132209323. The reversal of 3132209268 is 8629022313.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1077505 + ... + 1080407.
It is an arithmetic number, because the mean of its divisors is an integer number (61044984).
Almost surely, 23132209268 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 3132209268, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4395238848).
3132209268 is an abundant number, since it is smaller than the sum of its proper divisors (5658268428).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3132209268 is a wasteful number, since it uses less digits than its factorization.
3132209268 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3014 (or 3009 counting only the distinct ones).
The product of its (nonzero) digits is 31104, while the sum is 36.
The square root of 3132209268 is about 55966.1439443526. The cubic root of 3132209268 is about 1463.1322737974.
The spelling of 3132209268 in words is "three billion, one hundred thirty-two million, two hundred nine thousand, two hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •