Base | Representation |
---|---|
bin | 11111110001001111… |
… | …100010000011001000 |
3 | 10021001100000212002212 |
4 | 133301033202003020 |
5 | 1024330202324002 |
6 | 23400525444252 |
7 | 2315221335320 |
oct | 376117420310 |
9 | 107040025085 |
10 | 34112151752 |
11 | 13515469558 |
12 | 6740110688 |
13 | 32a82c33a3 |
14 | 1918634280 |
15 | d49b54352 |
hex | 7f13e20c8 |
34112151752 has 128 divisors (see below), whose sum is σ = 79841280000. Its totient is φ = 13333351680.
The previous prime is 34112151751. The next prime is 34112151767. The reversal of 34112151752 is 25715121143.
It is not an unprimeable number, because it can be changed into a prime (34112151751) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6561218 + ... + 6566414.
It is an arithmetic number, because the mean of its divisors is an integer number (623760000).
Almost surely, 234112151752 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 34112151752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (39920640000).
34112151752 is an abundant number, since it is smaller than the sum of its proper divisors (45729128248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
34112151752 is a wasteful number, since it uses less digits than its factorization.
34112151752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5459 (or 5455 counting only the distinct ones).
The product of its digits is 8400, while the sum is 32.
Adding to 34112151752 its reverse (25715121143), we get a palindrome (59827272895).
The spelling of 34112151752 in words is "thirty-four billion, one hundred twelve million, one hundred fifty-one thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •