Base | Representation |
---|---|
bin | 100011110100110101… |
… | …0101010101000000000 |
3 | 21100120201020201100002 |
4 | 1013221222222220000 |
5 | 2230030242020000 |
6 | 55202054015132 |
7 | 5362341221135 |
oct | 1075152525000 |
9 | 240521221302 |
10 | 76934720000 |
11 | 2a69a709926 |
12 | 12ab13474a8 |
13 | 7341075278 |
14 | 3a1ba1c58c |
15 | 20043328d5 |
hex | 11e9aaaa00 |
76934720000 has 100 divisors (see below), whose sum is σ = 192088282386. Its totient is φ = 30773760000.
The previous prime is 76934719973. The next prime is 76934720003. The reversal of 76934720000 is 2743967.
It can be written as a sum of positive squares in 5 ways, for example, as 9990402304 + 66944317696 = 99952^2 + 258736^2 .
It is a tau number, because it is divible by the number of its divisors (100).
It is a super-2 number, since 2×769347200002 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (76934720003) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 199790 + ... + 440210.
Almost surely, 276934720000 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 76934720000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (96044141193).
76934720000 is an abundant number, since it is smaller than the sum of its proper divisors (115153562386).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
76934720000 is an frugal number, since it uses more digits than its factorization.
76934720000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 240459 (or 240428 counting only the distinct ones).
The product of its (nonzero) digits is 63504, while the sum is 38.
The spelling of 76934720000 in words is "seventy-six billion, nine hundred thirty-four million, seven hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •