Base | Representation |
---|---|
bin | 1000010001000… |
… | …1011010111001 |
3 | 2102020122021121 |
4 | 2010101122321 |
5 | 32334034421 |
6 | 3235105241 |
7 | 600504301 |
oct | 204213271 |
9 | 72218247 |
10 | 34674361 |
11 | 186333a7 |
12 | b742221 |
13 | 7250797 |
14 | 4868601 |
15 | 309dd41 |
hex | 21116b9 |
34674361 has 4 divisors (see below), whose sum is σ = 34823412. Its totient is φ = 34525312.
The previous prime is 34674319. The next prime is 34674457. The reversal of 34674361 is 16347643.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 12996025 + 21678336 = 3605^2 + 4656^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-34674361 is a prime.
It is a super-2 number, since 2×346743612 = 2404622621516642, which contains 22 as substring.
It is a Duffinian number.
It is a nialpdrome in base 12.
It is not an unprimeable number, because it can be changed into a prime (34674061) 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, 74176 + ... + 74641.
It is an arithmetic number, because the mean of its divisors is an integer number (8705853).
Almost surely, 234674361 is an apocalyptic number.
It is an amenable number.
34674361 is a deficient number, since it is larger than the sum of its proper divisors (149051).
34674361 is a wasteful number, since it uses less digits than its factorization.
34674361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149050.
The product of its digits is 36288, while the sum is 34.
The square root of 34674361 is about 5888.4939500691. The cubic root of 34674361 is about 326.0890048920.
The spelling of 34674361 in words is "thirty-four million, six hundred seventy-four thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •