Recognised as Number
76,379
- Positive
- Odd
- Prime
- 5 digits
76,379 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value76,379
Digit count5
Digit sum32
Digit product7,938
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation76,379
Distinct prime factors176,379
Number of divisors2
Sum of divisors σ(n)76,380
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)76,378integers below n that share no factor with it
Carmichael function λ(n)76,378the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 76,3792 in total
Arithmetic
Representations
Decimal76,379
Binary1001010100101101117 bits
Octal225133
Hexadecimal12A5B
Base 361MXN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseventy-six thousand, three hundred and seventy-nine
Ordinalseventy-six thousand, three hundred and seventy-ninth
Scientific notation7.6379 × 10^4
Engineering notation76.379 × 10^3
In other bases
Ternary10212202212base 3; the most digit-efficient integer base after e: 11 digits
Quinary4421004base 5; one hand: 7 digits
Septenary435452base 7: 6 digits
Nonary125685base 9; each digit is two ternary digits: 6 digits
Duodecimal3824bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal9aijbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal21:12:59base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary110T0T100TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10111111110101111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010010101001011011
Bit length17 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits8within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 16worth 65,536
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes301 2a 5b
Gray code11011111101110110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010010101001011011
64-bit0000000000000000000000000000000000000000000000010010101001011011
One's complement11111111111111101101010110100100at 32 bits, every bit flipped
Bits reversed11011010010101001000000000000000at 32 bits
Rotated left by 100000000000000100101010010110110at 32 bits, wrapping
Shifted left by 1100101010010110110= 152,758, no wrap
Shifted right by 11001010100101101= 38,189, discarding the low bit
These bits as a double3.773624 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
76,379 to the power 25,833,751,641
76,379 to the power 3445,576,116,587,939
76,379 to the power 434,032,658,208,870,192,881
76,379 to the power 52,599,380,401,335,296,462,057,899
First ten multiples76,379, 152,758, 229,137, 305,516, 381,895, 458,274, 534,653, 611,032, 687,411, 763,790
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 3
Divisible by 9No, remainder 5
Divisible by 10No, remainder 9
Divisible by 11No, remainder 6
Divisible by 12No, remainder 11
Divisible by 100No, remainder 79
Collatz (3n + 1) trajectory
Steps to reach 1187the total stopping time
Highest value reached2,351,75230× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps76,379 → 229,138 → 114,569 → 343,708 → 171,854 → 85,927 → 257,782 → 128,891 → 386,674 → 193,337 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage7,637,900%
76,379% as a decimal763.79
76,379% of 10076,379
76,379% of 1,000763,790
As a fraction of 10076,379/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 76,379
Nerdulate something else
Nothing in mind? Surprise me · today’s page