Base | Representation |
---|---|
bin | 1001000111111… |
… | …00000111100110 |
3 | 12100000010122000 |
4 | 10203330013212 |
5 | 124042431100 |
6 | 11332150130 |
7 | 1616331654 |
oct | 443740746 |
9 | 170003560 |
10 | 76530150 |
11 | 3a221264 |
12 | 21768346 |
13 | 12b16c18 |
14 | a241dd4 |
15 | 6aba900 |
hex | 48fc1e6 |
76530150 has 96 divisors (see below), whose sum is σ = 213736320. Its totient is φ = 20132640.
The previous prime is 76530137. The next prime is 76530163. The reversal of 76530150 is 5103567.
76530150 is a `hidden beast` number, since 7 + 653 + 0 + 1 + 5 + 0 = 666.
It is an interprime number because it is at equal distance from previous prime (76530137) and next prime (76530163).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 111709 + ... + 112391.
It is an arithmetic number, because the mean of its divisors is an integer number (2226420).
Almost surely, 276530150 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 76530150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (106868160).
76530150 is an abundant number, since it is smaller than the sum of its proper divisors (137206170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
76530150 is a wasteful number, since it uses less digits than its factorization.
76530150 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 787 (or 776 counting only the distinct ones).
The product of its (nonzero) digits is 3150, while the sum is 27.
The square root of 76530150 is about 8748.1512332607. The cubic root of 76530150 is about 424.5649989745.
The spelling of 76530150 in words is "seventy-six million, five hundred thirty thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •