Base | Representation |
---|---|
bin | 11111111001101100… |
… | …111100101000001000 |
3 | 10021102020002120202220 |
4 | 133321230330220020 |
5 | 1030123021034040 |
6 | 23422555454040 |
7 | 2321563610652 |
oct | 377154745010 |
9 | 107366076686 |
10 | 34254080520 |
11 | 13588598760 |
12 | 677b757320 |
13 | 32cb8275ca |
14 | 192d41b6d2 |
15 | d5733c2d0 |
hex | 7f9b3ca08 |
34254080520 has 256 divisors, whose sum is σ = 115624454400. Its totient is φ = 8045199360.
The previous prime is 34254080477. The next prime is 34254080533. The reversal of 34254080520 is 2508045243.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 12550516 + ... + 12553244.
It is an arithmetic number, because the mean of its divisors is an integer number (451658025).
Almost surely, 234254080520 is an apocalyptic number.
34254080520 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 34254080520, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (57812227200).
34254080520 is an abundant number, since it is smaller than the sum of its proper divisors (81370373880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
34254080520 is a wasteful number, since it uses less digits than its factorization.
34254080520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3048 (or 3044 counting only the distinct ones).
The product of its (nonzero) digits is 38400, while the sum is 33.
The spelling of 34254080520 in words is "thirty-four billion, two hundred fifty-four million, eighty thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •