Base | Representation |
---|---|
bin | 1000010011000… |
… | …0010110101101 |
3 | 2102111002002111 |
4 | 2010300112231 |
5 | 32402113234 |
6 | 3241524021 |
7 | 601542562 |
oct | 204602655 |
9 | 72432074 |
10 | 34801069 |
11 | 1870a616 |
12 | b7a3611 |
13 | 7296364 |
14 | 489c869 |
15 | 30c6664 |
hex | 21305ad |
34801069 has 2 divisors, whose sum is σ = 34801070. Its totient is φ = 34801068.
The previous prime is 34801043. The next prime is 34801079. The reversal of 34801069 is 96010843.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 26904969 + 7896100 = 5187^2 + 2810^2 .
It is an emirp because it is prime and its reverse (96010843) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 34801069 - 25 = 34801037 is a prime.
It is a super-2 number, since 2×348010692 = 2422228807085522, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 34801069.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (34801079) 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 as a sum of consecutive naturals, namely, 17400534 + 17400535.
It is an arithmetic number, because the mean of its divisors is an integer number (17400535).
Almost surely, 234801069 is an apocalyptic number.
It is an amenable number.
34801069 is a deficient number, since it is larger than the sum of its proper divisors (1).
34801069 is an equidigital number, since it uses as much as digits as its factorization.
34801069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 31.
The square root of 34801069 is about 5899.2430870409. The cubic root of 34801069 is about 326.4857231761.
The spelling of 34801069 in words is "thirty-four million, eight hundred one thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •