Base | Representation |
---|---|
bin | 1001000100101… |
… | …10011101011100 |
3 | 12022012222110000 |
4 | 10202112131130 |
5 | 123441120011 |
6 | 11315214300 |
7 | 1612645665 |
oct | 442263534 |
9 | 168188400 |
10 | 76113756 |
11 | 39a67434 |
12 | 215a7390 |
13 | 129cc534 |
14 | a17436c |
15 | 6a37356 |
hex | 489675c |
76113756 has 60 divisors (see below), whose sum is σ = 199844568. Its totient is φ = 25260768.
The previous prime is 76113731. The next prime is 76113761. The reversal of 76113756 is 65731167.
76113756 is a `hidden beast` number, since 7 + 611 + 37 + 5 + 6 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 76113756.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 112090 + ... + 112766.
Almost surely, 276113756 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 76113756, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (99922284).
76113756 is an abundant number, since it is smaller than the sum of its proper divisors (123730812).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
76113756 is a wasteful number, since it uses less digits than its factorization.
76113756 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1040 (or 1029 counting only the distinct ones).
The product of its digits is 26460, while the sum is 36.
The square root of 76113756 is about 8724.3198015662. The cubic root of 76113756 is about 423.7935909421.
The spelling of 76113756 in words is "seventy-six million, one hundred thirteen thousand, seven hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •