Base | Representation |
---|---|
bin | 11111111001101001… |
… | …101000001000100111 |
3 | 10021102011110100212000 |
4 | 133321221220020213 |
5 | 1030122310211101 |
6 | 23422525100343 |
7 | 2321553324306 |
oct | 377151501047 |
9 | 107364410760 |
10 | 34253210151 |
11 | 13588053846 |
12 | 677b3b76b3 |
13 | 32cb5b13b4 |
14 | 192d27243d |
15 | d57219486 |
hex | 7f9a68227 |
34253210151 has 8 divisors (see below), whose sum is σ = 50745496560. Its totient is φ = 22835473416.
The previous prime is 34253210143. The next prime is 34253210177. The reversal of 34253210151 is 15101235243.
It is not a de Polignac number, because 34253210151 - 23 = 34253210143 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 1268637413 = 34253210151 / (3 + 4 + 2 + 5 + 3 + 2 + 1 + 0 + 1 + 5 + 1).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (34253210351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 634318680 + ... + 634318733.
It is an arithmetic number, because the mean of its divisors is an integer number (6343187070).
Almost surely, 234253210151 is an apocalyptic number.
34253210151 is a deficient number, since it is larger than the sum of its proper divisors (16492286409).
34253210151 is a wasteful number, since it uses less digits than its factorization.
34253210151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1268637422 (or 1268637416 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
Adding to 34253210151 its reverse (15101235243), we get a palindrome (49354445394).
The spelling of 34253210151 in words is "thirty-four billion, two hundred fifty-three million, two hundred ten thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •