Base | Representation |
---|---|
bin | 1000001101011… |
… | …0101010100001 |
3 | 2101210102011010 |
4 | 2003112222201 |
5 | 32303334242 |
6 | 3230011133 |
7 | 565452534 |
oct | 203265241 |
9 | 71712133 |
10 | 34433697 |
11 | 18489601 |
12 | b646aa9 |
13 | 719808c |
14 | 4804a1b |
15 | 305289c |
hex | 20d6aa1 |
34433697 has 4 divisors (see below), whose sum is σ = 45911600. Its totient is φ = 22955796.
The previous prime is 34433647. The next prime is 34433713. The reversal of 34433697 is 79633443.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 79633443 = 3 ⋅26544481.
It is not a de Polignac number, because 34433697 - 212 = 34429601 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (34433617) 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 in 3 ways as a sum of consecutive naturals, for example, 5738947 + ... + 5738952.
It is an arithmetic number, because the mean of its divisors is an integer number (11477900).
Almost surely, 234433697 is an apocalyptic number.
It is an amenable number.
34433697 is a deficient number, since it is larger than the sum of its proper divisors (11477903).
34433697 is a wasteful number, since it uses less digits than its factorization.
34433697 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11477902.
The product of its digits is 163296, while the sum is 39.
The square root of 34433697 is about 5868.0232617126. The cubic root of 34433697 is about 325.3328251200.
It can be divided in two parts, 3443 and 3697, that added together give a triangular number (7140 = T119).
The spelling of 34433697 in words is "thirty-four million, four hundred thirty-three thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •