Base | Representation |
---|---|
bin | 1000000111100… |
… | …0111011110001 |
3 | 2101001220111212 |
4 | 2001320323301 |
5 | 32204043102 |
6 | 3213445505 |
7 | 562263326 |
oct | 201707361 |
9 | 71056455 |
10 | 34049777 |
11 | 18247113 |
12 | b4a0895 |
13 | 70923c8 |
14 | 4744b4d |
15 | 2ec8c52 |
hex | 2078ef1 |
34049777 has 2 divisors, whose sum is σ = 34049778. Its totient is φ = 34049776.
The previous prime is 34049753. The next prime is 34049779. The reversal of 34049777 is 77794043.
34049777 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., 19678096 + 14371681 = 4436^2 + 3791^2 .
It is an emirp because it is prime and its reverse (77794043) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 34049777 - 26 = 34049713 is a prime.
Together with 34049779, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (34049779) 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, 17024888 + 17024889.
It is an arithmetic number, because the mean of its divisors is an integer number (17024889).
Almost surely, 234049777 is an apocalyptic number.
It is an amenable number.
34049777 is a deficient number, since it is larger than the sum of its proper divisors (1).
34049777 is an equidigital number, since it uses as much as digits as its factorization.
34049777 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 148176, while the sum is 41.
The square root of 34049777 is about 5835.2186762794. The cubic root of 34049777 is about 324.1191992699.
The spelling of 34049777 in words is "thirty-four million, forty-nine thousand, seven hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •