Base | Representation |
---|---|
bin | 1000101011001100… |
… | …0000000000000000 |
3 | 20000021201102012000 |
4 | 2022303000000000 |
5 | 14232112001102 |
6 | 1023022304000 |
7 | 111463662420 |
oct | 21263000000 |
9 | 6007642160 |
10 | 2328625152 |
11 | a954a25a7 |
12 | 54ba28000 |
13 | 2b1588409 |
14 | 1813a0480 |
15 | d967801c |
hex | 8acc0000 |
2328625152 has 304 divisors, whose sum is σ = 8053048320. Its totient is φ = 651165696.
The previous prime is 2328625147. The next prime is 2328625207. The reversal of 2328625152 is 2515268232.
It is a happy number.
2328625152 is a `hidden beast` number, since 2 + 3 + 28 + 625 + 1 + 5 + 2 = 666.
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 (7) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 49545193 + ... + 49545239.
Almost surely, 22328625152 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 2328625152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4026524160).
2328625152 is an abundant number, since it is smaller than the sum of its proper divisors (5724423168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2328625152 is an frugal number, since it uses more digits than its factorization.
2328625152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99 (or 59 counting only the distinct ones).
The product of its digits is 57600, while the sum is 36.
The square root of 2328625152 is about 48255.8302384282. The cubic root of 2328625152 is about 1325.4597008447.
The spelling of 2328625152 in words is "two billion, three hundred twenty-eight million, six hundred twenty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •