Base | Representation |
---|---|
bin | 100000000001001… |
… | …0001000101111101 |
3 | 2202212112221002212 |
4 | 1000002101011331 |
5 | 4200012224000 |
6 | 254334430205 |
7 | 35423464202 |
oct | 10002210575 |
9 | 2685487085 |
10 | 1074336125 |
11 | 5014866a5 |
12 | 25b962365 |
13 | 141766565 |
14 | a297bca9 |
15 | 644b6c35 |
hex | 4009117d |
1074336125 has 8 divisors (see below), whose sum is σ = 1340771640. Its totient is φ = 859468800.
The previous prime is 1074336121. The next prime is 1074336139. The reversal of 1074336125 is 5216334701.
It can be written as a sum of positive squares in 4 ways, for example, as 192127321 + 882208804 = 13861^2 + 29702^2 .
It is not a de Polignac number, because 1074336125 - 22 = 1074336121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1074336091 and 1074336100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1074336121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4297220 + ... + 4297469.
It is an arithmetic number, because the mean of its divisors is an integer number (167596455).
Almost surely, 21074336125 is an apocalyptic number.
It is an amenable number.
1074336125 is a deficient number, since it is larger than the sum of its proper divisors (266435515).
1074336125 is an frugal number, since it uses more digits than its factorization.
1074336125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8594704 (or 8594694 counting only the distinct ones).
The product of its (nonzero) digits is 15120, while the sum is 32.
The square root of 1074336125 is about 32777.0670591498. The cubic root of 1074336125 is about 1024.1888883552.
The spelling of 1074336125 in words is "one billion, seventy-four million, three hundred thirty-six thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •