Base | Representation |
---|---|
bin | 1011101111101001… |
… | …1101001000001100 |
3 | 22010201021212200020 |
4 | 2323322131020030 |
5 | 22424040204202 |
6 | 1240500302140 |
7 | 141061123320 |
oct | 27372351014 |
9 | 8121255606 |
10 | 3152663052 |
11 | 1378661460 |
12 | 73b9a1950 |
13 | 3b32065c6 |
14 | 21c9c5980 |
15 | 136b9c5bc |
hex | bbe9d20c |
3152663052 has 96 divisors (see below), whose sum is σ = 9181638144. Its totient is φ = 817958400.
The previous prime is 3152663047. The next prime is 3152663081. The reversal of 3152663052 is 2503662513.
It is a Harshad number since it is a multiple of its sum of digits (33).
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 31 ways as a sum of consecutive naturals, for example, 1322902 + ... + 1325282.
It is an arithmetic number, because the mean of its divisors is an integer number (95642064).
Almost surely, 23152663052 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 3152663052, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4590819072).
3152663052 is an abundant number, since it is smaller than the sum of its proper divisors (6028975092).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3152663052 is a wasteful number, since it uses less digits than its factorization.
3152663052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3839 (or 3837 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 33.
The square root of 3152663052 is about 56148.5801423331. The cubic root of 3152663052 is about 1466.3101888691.
The spelling of 3152663052 in words is "three billion, one hundred fifty-two million, six hundred sixty-three thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •