Recognised as Number
75,379
- Positive
- Odd
- Composite
- 5 digits
75,379 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value75,379
Digit count5
Digit sum31
Digit product6,615
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation43 × 1,753
Distinct prime factors243, 1,753
Number of divisors4
Sum of divisors σ(n)77,176
Aliquot sum1,797sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)73,584integers below n that share no factor with it
Carmichael function λ(n)12,264the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 73,584
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 43, 1,753, 75,3794 in total
Arithmetic
Representations
Decimal75,379
Binary1001001100111001117 bits
Octal223163
Hexadecimal12673
Base 361M5V
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseventy-five thousand, three hundred and seventy-nine
Ordinalseventy-five thousand, three hundred and seventy-ninth
Scientific notation7.5379 × 10^4
Engineering notation75.379 × 10^3
In other bases
Ternary10211101211base 3; the most digit-efficient integer base after e: 11 digits
Quinary4403004base 5; one hand: 7 digits
Septenary432523base 7: 6 digits
Nonary124354base 9; each digit is two ternary digits: 6 digits
Duodecimal37757base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal988jbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal20:56:19base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary11T1111TT11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10111101110110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010010011001110011
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 26 73
Gray code11011010101001010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010010011001110011
64-bit0000000000000000000000000000000000000000000000010010011001110011
One's complement11111111111111101101100110001100at 32 bits, every bit flipped
Bits reversed11001110011001001000000000000000at 32 bits
Rotated left by 100000000000000100100110011100110at 32 bits, wrapping
Shifted left by 1100100110011100110= 150,758, no wrap
Shifted right by 11001001100111001= 37,689, discarding the low bit
These bits as a double3.72421743 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
75,379 to the power 25,681,993,641
75,379 to the power 3428,302,998,664,939
75,379 to the power 432,285,051,736,364,436,881
75,379 to the power 52,433,614,914,835,414,887,652,899
First ten multiples75,379, 150,758, 226,137, 301,516, 376,895, 452,274, 527,653, 603,032, 678,411, 753,790
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 4
Divisible by 10No, remainder 9
Divisible by 11No, remainder 7
Divisible by 12No, remainder 7
Divisible by 100No, remainder 79
Collatz (3n + 1) trajectory
Steps to reach 1138the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps75,379 → 226,138 → 113,069 → 339,208 → 169,604 → 84,802 → 42,401 → 127,204 → 63,602 → 31,801 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage7,537,900%
75,379% as a decimal753.79
75,379% of 10075,379
75,379% of 1,000753,790
As a fraction of 10075,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 75,379
Nerdulate something else
Nothing in mind? Surprise me · today’s page