Base | Representation |
---|---|
bin | 11111111100110001… |
… | …110100110110110000 |
3 | 10021112211012200010020 |
4 | 133330301310312300 |
5 | 1030224224103211 |
6 | 23432042003440 |
7 | 2323061364000 |
oct | 377461646660 |
9 | 107484180106 |
10 | 34305691056 |
11 | 1360473949a |
12 | 6794aa6580 |
13 | 3309427aa0 |
14 | 1936214000 |
15 | d5bb34306 |
hex | 7fcc74db0 |
34305691056 has 320 divisors, whose sum is σ = 115159296000. Its totient is φ = 8734086144.
The previous prime is 34305691051. The next prime is 34305691073. The reversal of 34305691056 is 65019650343.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 34305690999 and 34305691017.
It is not an unprimeable number, because it can be changed into a prime (34305691051) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 6204165 + ... + 6209691.
It is an arithmetic number, because the mean of its divisors is an integer number (359872800).
Almost surely, 234305691056 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 34305691056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (57579648000).
34305691056 is an abundant number, since it is smaller than the sum of its proper divisors (80853604944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
34305691056 is a wasteful number, since it uses less digits than its factorization.
34305691056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5601 (or 5581 counting only the distinct ones).
The product of its (nonzero) digits is 291600, while the sum is 42.
The spelling of 34305691056 in words is "thirty-four billion, three hundred five million, six hundred ninety-one thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •