Base | Representation |
---|---|
bin | 1000101011100111… |
… | …1110000010011101 |
3 | 20000102011020022200 |
4 | 2022321332002131 |
5 | 14233043432000 |
6 | 1023125402113 |
7 | 111515342031 |
oct | 21271760235 |
9 | 6012136280 |
10 | 2330452125 |
11 | a965301a1 |
12 | 550569339 |
13 | 2b1a77b71 |
14 | 1817181c1 |
15 | d98d9500 |
hex | 8ae7e09d |
2330452125 has 96 divisors (see below), whose sum is σ = 4566082560. Its totient is φ = 1139184000.
The previous prime is 2330452121. The next prime is 2330452127. The reversal of 2330452125 is 5212540332.
It is a happy number.
It is not a de Polignac number, because 2330452125 - 22 = 2330452121 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2330452121) by changing a digit.
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 95 ways as a sum of consecutive naturals, for example, 660867 + ... + 664383.
It is an arithmetic number, because the mean of its divisors is an integer number (47563360).
Almost surely, 22330452125 is an apocalyptic number.
2330452125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2330452125 is a deficient number, since it is larger than the sum of its proper divisors (2235630435).
2330452125 is a wasteful number, since it uses less digits than its factorization.
2330452125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3588 (or 3575 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 27.
The square root of 2330452125 is about 48274.7566021829. The cubic root of 2330452125 is about 1325.8062495452.
Adding to 2330452125 its reverse (5212540332), we get a palindrome (7542992457).
The spelling of 2330452125 in words is "two billion, three hundred thirty million, four hundred fifty-two thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •