Base | Representation |
---|---|
bin | 1000000111011… |
… | …0111011100001 |
3 | 2101001111020212 |
4 | 2001312323201 |
5 | 32203312234 |
6 | 3213343505 |
7 | 562230362 |
oct | 201667341 |
9 | 71044225 |
10 | 34041569 |
11 | 18240a31 |
12 | b497b95 |
13 | 708b753 |
14 | 4741b69 |
15 | 2ec65ce |
hex | 2076ee1 |
34041569 has 2 divisors, whose sum is σ = 34041570. Its totient is φ = 34041568.
The previous prime is 34041551. The next prime is 34041577. The reversal of 34041569 is 96514043.
34041569 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 31192225 + 2849344 = 5585^2 + 1688^2 .
It is a cyclic number.
It is not a de Polignac number, because 34041569 - 28 = 34041313 is a prime.
It is a super-2 number, since 2×340415692 = 2317656839963522, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (34041169) 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 as a sum of consecutive naturals, namely, 17020784 + 17020785.
It is an arithmetic number, because the mean of its divisors is an integer number (17020785).
Almost surely, 234041569 is an apocalyptic number.
It is an amenable number.
34041569 is a deficient number, since it is larger than the sum of its proper divisors (1).
34041569 is an equidigital number, since it uses as much as digits as its factorization.
34041569 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12960, while the sum is 32.
The square root of 34041569 is about 5834.5153183448. The cubic root of 34041569 is about 324.0931532434.
The spelling of 34041569 in words is "thirty-four million, forty-one thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •