Base | Representation |
---|---|
bin | 1001000110100… |
… | …11110100110100 |
3 | 12022200202020100 |
4 | 10203103310310 |
5 | 124022140413 |
6 | 11324434100 |
7 | 1615043541 |
oct | 443236464 |
9 | 168622210 |
10 | 76365108 |
11 | 3a119266 |
12 | 216a8930 |
13 | 12a89a71 |
14 | a1dbbc8 |
15 | 6a86a73 |
hex | 48d3d34 |
76365108 has 18 divisors (see below), whose sum is σ = 193034114. Its totient is φ = 25455024.
The previous prime is 76365097. The next prime is 76365137. The reversal of 76365108 is 80156367.
76365108 is a `hidden beast` number, since 7 + 636 + 5 + 10 + 8 = 666.
It can be written as a sum of positive squares in only one way, i.e., 40220964 + 36144144 = 6342^2 + 6012^2 .
It is a tau number, because it is divible by the number of its divisors (18).
It is a Harshad number since it is a multiple of its sum of digits (36), and also a Moran number because the ratio is a prime number: 2121253 = 76365108 / (7 + 6 + 3 + 6 + 5 + 1 + 0 + 8).
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 5 ways as a sum of consecutive naturals, for example, 1060591 + ... + 1060662.
Almost surely, 276365108 is an apocalyptic number.
It is an amenable number.
76365108 is an abundant number, since it is smaller than the sum of its proper divisors (116669006).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
76365108 is a wasteful number, since it uses less digits than its factorization.
76365108 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2121263 (or 2121258 counting only the distinct ones).
The product of its (nonzero) digits is 30240, while the sum is 36.
The square root of 76365108 is about 8738.7131775794. The cubic root of 76365108 is about 424.2595790938.
The spelling of 76365108 in words is "seventy-six million, three hundred sixty-five thousand, one hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •