Base | Representation |
---|---|
bin | 1000010100110… |
… | …0011110101101 |
3 | 2102200221010011 |
4 | 2011030132231 |
5 | 32414310034 |
6 | 3244213221 |
7 | 602532463 |
oct | 205143655 |
9 | 72627104 |
10 | 34916269 |
11 | 18789123 |
12 | b83a211 |
13 | 730691b |
14 | 48cc833 |
15 | 30ea864 |
hex | 214c7ad |
34916269 has 2 divisors, whose sum is σ = 34916270. Its totient is φ = 34916268.
The previous prime is 34916267. The next prime is 34916291. The reversal of 34916269 is 96261943.
34916269 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 33988900 + 927369 = 5830^2 + 963^2 .
It is a cyclic number.
It is not a de Polignac number, because 34916269 - 21 = 34916267 is a prime.
It is a super-2 number, since 2×349162692 = 2438291681760722, which contains 22 as substring.
Together with 34916267, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (34916267) 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, 17458134 + 17458135.
It is an arithmetic number, because the mean of its divisors is an integer number (17458135).
Almost surely, 234916269 is an apocalyptic number.
It is an amenable number.
34916269 is a deficient number, since it is larger than the sum of its proper divisors (1).
34916269 is an equidigital number, since it uses as much as digits as its factorization.
34916269 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 69984, while the sum is 40.
The square root of 34916269 is about 5908.9989845997. The cubic root of 34916269 is about 326.8455754436.
The spelling of 34916269 in words is "thirty-four million, nine hundred sixteen thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •