Base | Representation |
---|---|
bin | 1000101001110110… |
… | …0011010010100000 |
3 | 12222220010202101200 |
4 | 2022131203102200 |
5 | 14224142040103 |
6 | 1022302001200 |
7 | 111365124060 |
oct | 21235432240 |
9 | 5886122350 |
10 | 2323002528 |
11 | a92302200 |
12 | 549b76200 |
13 | 2b036a112 |
14 | 1807393a0 |
15 | d8e170a3 |
hex | 8a7634a0 |
2323002528 has 432 divisors, whose sum is σ = 8470163520. Its totient is φ = 591022080.
The previous prime is 2323002509. The next prime is 2323002557. The reversal of 2323002528 is 8252003232.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 21710251 + ... + 21710357.
It is an arithmetic number, because the mean of its divisors is an integer number (19606860).
Almost surely, 22323002528 is an apocalyptic number.
2323002528 is a gapful number since it is divisible by the number (28) 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 2323002528, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4235081760).
2323002528 is an abundant number, since it is smaller than the sum of its proper divisors (6147160992).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2323002528 is a wasteful number, since it uses less digits than its factorization.
2323002528 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 241 (or 219 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 27.
The square root of 2323002528 is about 48197.5365345574. The cubic root of 2323002528 is about 1324.3920368318.
The spelling of 2323002528 in words is "two billion, three hundred twenty-three million, two thousand, five hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •