Base | Representation |
---|---|
bin | 1000000111100… |
… | …1001010100101 |
3 | 2101001221210222 |
4 | 2001321022211 |
5 | 32204110400 |
6 | 3213454125 |
7 | 562266152 |
oct | 201711245 |
9 | 71057728 |
10 | 34050725 |
11 | 182478a5 |
12 | b4a1345 |
13 | 7092977 |
14 | 4745229 |
15 | 2ec9185 |
hex | 20792a5 |
34050725 has 12 divisors (see below), whose sum is σ = 42472356. Its totient is φ = 27079680.
The previous prime is 34050721. The next prime is 34050739. The reversal of 34050725 is 52705043.
It can be written as a sum of positive squares in 6 ways, for example, as 1435204 + 32615521 = 1198^2 + 5711^2 .
It is not a de Polignac number, because 34050725 - 22 = 34050721 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 34050694 and 34050703.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (34050721) 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 11 ways as a sum of consecutive naturals, for example, 389 + ... + 8261.
It is an arithmetic number, because the mean of its divisors is an integer number (3539363).
Almost surely, 234050725 is an apocalyptic number.
It is an amenable number.
34050725 is a deficient number, since it is larger than the sum of its proper divisors (8421631).
34050725 is a wasteful number, since it uses less digits than its factorization.
34050725 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8056 (or 8051 counting only the distinct ones).
The product of its (nonzero) digits is 4200, while the sum is 26.
The square root of 34050725 is about 5835.2999066029. The cubic root of 34050725 is about 324.1222072402.
Adding to 34050725 its reverse (52705043), we get a palindrome (86755768).
The spelling of 34050725 in words is "thirty-four million, fifty thousand, seven hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •