Base | Representation |
---|---|
bin | 1000001010101… |
… | …1111001100011 |
3 | 2101110111212111 |
4 | 2002223321203 |
5 | 32232233111 |
6 | 3222140151 |
7 | 564123046 |
oct | 202537143 |
9 | 71414774 |
10 | 34258531 |
11 | 18379a3a |
12 | b581657 |
13 | 7136428 |
14 | 479ac5d |
15 | 301aa21 |
hex | 20abe63 |
34258531 has 2 divisors, whose sum is σ = 34258532. Its totient is φ = 34258530.
The previous prime is 34258513. The next prime is 34258583. The reversal of 34258531 is 13585243.
34258531 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with previous prime (34258513) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 34258531 - 27 = 34258403 is a prime.
It is a super-2 number, since 2×342585312 = 2347293892555922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 34258493 and 34258502.
It is not a weakly prime, because it can be changed into another prime (34258031) 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 as a sum of consecutive naturals, namely, 17129265 + 17129266.
It is an arithmetic number, because the mean of its divisors is an integer number (17129266).
Almost surely, 234258531 is an apocalyptic number.
34258531 is a deficient number, since it is larger than the sum of its proper divisors (1).
34258531 is an equidigital number, since it uses as much as digits as its factorization.
34258531 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 14400, while the sum is 31.
The square root of 34258531 is about 5853.0787624976. The cubic root of 34258531 is about 324.7802253799.
The spelling of 34258531 in words is "thirty-four million, two hundred fifty-eight thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •