Base | Representation |
---|---|
bin | 1000010001011… |
… | …0000101110101 |
3 | 2102021121112012 |
4 | 2010112011311 |
5 | 32340142433 |
6 | 3235334005 |
7 | 600614132 |
oct | 204260565 |
9 | 72247465 |
10 | 34693493 |
11 | 1864680a |
12 | b751305 |
13 | 72593c3 |
14 | 4871589 |
15 | 30a4848 |
hex | 2116175 |
34693493 has 2 divisors, whose sum is σ = 34693494. Its totient is φ = 34693492.
The previous prime is 34693459. The next prime is 34693517. The reversal of 34693493 is 39439643.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 33258289 + 1435204 = 5767^2 + 1198^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-34693493 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 34693493.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (34693693) 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, 17346746 + 17346747.
It is an arithmetic number, because the mean of its divisors is an integer number (17346747).
Almost surely, 234693493 is an apocalyptic number.
It is an amenable number.
34693493 is a deficient number, since it is larger than the sum of its proper divisors (1).
34693493 is an equidigital number, since it uses as much as digits as its factorization.
34693493 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 209952, while the sum is 41.
The square root of 34693493 is about 5890.1182500863. The cubic root of 34693493 is about 326.1489683884.
It can be divided in two parts, 346 and 93493, that added together give a palindrome (93839).
The spelling of 34693493 in words is "thirty-four million, six hundred ninety-three thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •