Base | Representation |
---|---|
bin | 1000000111100… |
… | …0010101110111 |
3 | 2101001210012000 |
4 | 2001320111313 |
5 | 32204003401 |
6 | 3213430343 |
7 | 562253262 |
oct | 201702567 |
9 | 71053160 |
10 | 34047351 |
11 | 18245308 |
12 | b49b3b3 |
13 | 7091280 |
14 | 4743cd9 |
15 | 2ec8186 |
hex | 2078577 |
34047351 has 16 divisors (see below), whose sum is σ = 54321120. Its totient is φ = 20952000.
The previous prime is 34047319. The next prime is 34047353. The reversal of 34047351 is 15374043.
34047351 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 34047351 - 25 = 34047319 is a prime.
It is a super-2 number, since 2×340473512 = 2318444220234402, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (34047353) 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 in 15 ways as a sum of consecutive naturals, for example, 48150 + ... + 48851.
It is an arithmetic number, because the mean of its divisors is an integer number (3395070).
Almost surely, 234047351 is an apocalyptic number.
34047351 is a deficient number, since it is larger than the sum of its proper divisors (20273769).
34047351 is a wasteful number, since it uses less digits than its factorization.
34047351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97023 (or 97017 counting only the distinct ones).
The product of its (nonzero) digits is 5040, while the sum is 27.
The square root of 34047351 is about 5835.0107969052. The cubic root of 34047351 is about 324.1115014040. Note that the first 3 decimals are identical.
The spelling of 34047351 in words is "thirty-four million, forty-seven thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •