Base | Representation |
---|---|
bin | 1000001011110… |
… | …1111010000101 |
3 | 2101121021001102 |
4 | 2002331322011 |
5 | 32242113133 |
6 | 3223505445 |
7 | 564551102 |
oct | 202757205 |
9 | 71537042 |
10 | 34332293 |
11 | 1841a3a6 |
12 | b5b8285 |
13 | 7160b88 |
14 | 47b9aa9 |
15 | 30327e8 |
hex | 20bde85 |
34332293 has 4 divisors (see below), whose sum is σ = 35169708. Its totient is φ = 33494880.
The previous prime is 34332257. The next prime is 34332301. The reversal of 34332293 is 39223343.
34332293 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1350244 + 32982049 = 1162^2 + 5743^2 .
It is a cyclic number.
It is not a de Polignac number, because 34332293 - 220 = 33283717 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (34332253) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 418646 + ... + 418727.
It is an arithmetic number, because the mean of its divisors is an integer number (8792427).
Almost surely, 234332293 is an apocalyptic number.
It is an amenable number.
34332293 is a deficient number, since it is larger than the sum of its proper divisors (837415).
34332293 is an equidigital number, since it uses as much as digits as its factorization.
34332293 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 837414.
The product of its digits is 11664, while the sum is 29.
The square root of 34332293 is about 5859.3765026665. The cubic root of 34332293 is about 325.0131529194.
The spelling of 34332293 in words is "thirty-four million, three hundred thirty-two thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •