Base | Representation |
---|---|
bin | 111011101001001… |
… | …001101011111101 |
3 | 2120201212221120220 |
4 | 323221021223331 |
5 | 4022131041300 |
6 | 243143131553 |
7 | 33540220323 |
oct | 7351115375 |
9 | 2521787526 |
10 | 1000643325 |
11 | 473923160 |
12 | 23b143bb9 |
13 | 12c403c56 |
14 | 96c77d13 |
15 | 5ccabda0 |
hex | 3ba49afd |
1000643325 has 96 divisors (see below), whose sum is σ = 1878784512. Its totient is φ = 465696000.
The previous prime is 1000643321. The next prime is 1000643383. The reversal of 1000643325 is 5233460001.
It is a happy number.
It is not a de Polignac number, because 1000643325 - 22 = 1000643321 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1000643295 and 1000643304.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1000643321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 2376615 + ... + 2377035.
It is an arithmetic number, because the mean of its divisors is an integer number (19570672).
Almost surely, 21000643325 is an apocalyptic number.
1000643325 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1000643325 is a deficient number, since it is larger than the sum of its proper divisors (878141187).
1000643325 is a wasteful number, since it uses less digits than its factorization.
1000643325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 555 (or 550 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 24.
The square root of 1000643325 is about 31632.9468276353. The cubic root of 1000643325 is about 1000.2143956979.
The spelling of 1000643325 in words is "one billion, six hundred forty-three thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.947 sec. • engine limits •