Base | Representation |
---|---|
bin | 1001001001011… |
… | …01111010111010 |
3 | 12100101111110010 |
4 | 10210231322322 |
5 | 124120443023 |
6 | 11340402350 |
7 | 1621141455 |
oct | 444557272 |
9 | 170344403 |
10 | 76734138 |
11 | 3a350548 |
12 | 218463b6 |
13 | 12b88a20 |
14 | a29649c |
15 | 6b0b093 |
hex | 492deba |
76734138 has 16 divisors (see below), whose sum is σ = 165273696. Its totient is φ = 23610480.
The previous prime is 76734137. The next prime is 76734139. The reversal of 76734138 is 83143767.
It is an interprime number because it is at equal distance from previous prime (76734137) and next prime (76734139).
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a junction number, because it is equal to n+sod(n) for n = 76734096 and 76734105.
It is not an unprimeable number, because it can be changed into a prime (76734131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 491808 + ... + 491963.
It is an arithmetic number, because the mean of its divisors is an integer number (10329606).
Almost surely, 276734138 is an apocalyptic number.
76734138 is a gapful number since it is divisible by the number (78) formed by its first and last digit.
76734138 is an abundant number, since it is smaller than the sum of its proper divisors (88539558).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
76734138 is a wasteful number, since it uses less digits than its factorization.
76734138 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 983789.
The product of its digits is 84672, while the sum is 39.
The square root of 76734138 is about 8759.8023950315. The cubic root of 76734138 is about 424.9418845564.
It can be divided in two parts, 7673 and 4138, that added together give a palindrome (11811).
The spelling of 76734138 in words is "seventy-six million, seven hundred thirty-four thousand, one hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •