Recognised as Number
75,743
- Positive
- Odd
- Prime
- 5 digits
75,743 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value75,743
Digit count5
Digit sum26
Digit product2,940
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation75,743
Distinct prime factors175,743
Number of divisors2
Sum of divisors σ(n)75,744
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)75,742integers below n that share no factor with it
Carmichael function λ(n)75,742the 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, 75,7432 in total
Arithmetic
Representations
Decimal75,743
Binary1001001111101111117 bits
Octal223737
Hexadecimal127DF
Base 361MFZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseventy-five thousand, seven hundred and forty-three
Ordinalseventy-five thousand, seven hundred and forty-third
Scientific notation7.5743 × 10^4
Engineering notation75.743 × 10^3
In other bases
Ternary10211220022base 3; the most digit-efficient integer base after e: 11 digits
Quinary4410433base 5; one hand: 7 digits
Septenary433553base 7: 6 digits
Nonary124808base 9; each digit is two ternary digits: 6 digits
Duodecimal379bbbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal9973base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal21:2:23base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary110TT0T010Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10111100000100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010010011111011111
Bit length17 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits5within that length
Bit parityeven12 set bits, so even; 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 27 df
Gray code11011010000110000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010010011111011111
64-bit0000000000000000000000000000000000000000000000010010011111011111
One's complement11111111111111101101100000100000at 32 bits, every bit flipped
Bits reversed11111011111001001000000000000000at 32 bits
Rotated left by 100000000000000100100111110111110at 32 bits, wrapping
Shifted left by 1100100111110111110= 151,486, no wrap
Shifted right by 11001001111101111= 37,871, discarding the low bit
These bits as a double3.74220142 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
75,743 to the power 25,737,002,049
75,743 to the power 3434,537,746,197,407
75,743 to the power 432,913,192,510,230,198,401
75,743 to the power 52,492,943,940,302,365,917,486,943
First ten multiples75,743, 151,486, 227,229, 302,972, 378,715, 454,458, 530,201, 605,944, 681,687, 757,430
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 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 7
Divisible by 9No, remainder 8
Divisible by 10No, remainder 3
Divisible by 11No, remainder 8
Divisible by 12No, remainder 11
Divisible by 100No, remainder 43
Collatz (3n + 1) trajectory
Steps to reach 1107the total stopping time
Highest value reached1,150,36015× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps75,743 → 227,230 → 113,615 → 340,846 → 170,423 → 511,270 → 255,635 → 766,906 → 383,453 → 1,150,360 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage7,574,300%
75,743% as a decimal757.43
75,743% of 10075,743
75,743% of 1,000757,430
As a fraction of 10075,743/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,743
Nerdulate something else
Nothing in mind? Surprise me · today’s page