Recognised as Number

75,143

Positive
Odd
Composite
5 digits

75,143 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value75,143

Digit count5

Digit sum20

Digit product420

Multiplicative persistence2times the digit product can be taken before one digit is left

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation163 × 461

Distinct prime factors2163, 461

Number of divisors4

Sum of divisors σ(n)75,768

Aliquot sum625sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)74,520integers below n that share no factor with it

Carmichael function λ(n)37,260the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 74,520

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 163, 461, 75,1434 in total

Arithmetic

Previous number75,142

Next number75,144

Double150,286

Half37,571.5

Square5,646,470,449

Cube424,292,728,949,207

Square root274.122235508≈irrational, shown to 9 decimal places

Cube root42.198418664≈

Negation-75,143

Reciprocal0.000013308≈

Representations

Decimal75,143

Binary1001001011000011117 bits

Octal222607

Hexadecimal12587

Base 361LZB

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsseventy-five thousand, one hundred and forty-three

Ordinalseventy-five thousand, one hundred and forty-third

Scientific notation7.5143 × 10^4

Engineering notation75.143 × 10^3

In other bases

Ternary10211002002base 3; the most digit-efficient integer base after e: 11 digits

Quinary4401033base 5; one hand: 7 digits

Septenary432035base 7: 6 digits

Nonary124062base 9; each digit is two ternary digits: 6 digits

Duodecimal3759bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits

Vigesimal97h3base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal20:52:23base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

Balanced ternary11T1101T01Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary10111101010011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000000010010010110000111

Bit length17 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits9within that length

Bit parityeven8 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 25 87

Gray code11011011101000100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010010010110000111

64-bit0000000000000000000000000000000000000000000000010010010110000111

One's complement11111111111111101101101001111000at 32 bits, every bit flipped

Bits reversed11100001101001001000000000000000at 32 bits

Rotated left by 100000000000000100100101100001110at 32 bits, wrapping

Shifted left by 1100100101100001110= 150,286, no wrap

Shifted right by 11001001011000011= 37,571, discarding the low bit

These bits as a double3.71255748 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime75,149+6

Previous prime75,133−10

Distance to nearest prime6

Nearest square below75,076

Nearest square above75,625

Powers & multiples

75,143 to the power 25,646,470,449

75,143 to the power 3424,292,728,949,207

75,143 to the power 431,882,628,531,430,261,601

75,143 to the power 52,395,756,355,737,264,147,483,943

First ten multiples75,143, 150,286, 225,429, 300,572, 375,715, 450,858, 526,001, 601,144, 676,287, 751,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 5

Divisible by 8No, remainder 7

Divisible by 9No, remainder 2

Divisible by 10No, remainder 3

Divisible by 11No, remainder 2

Divisible by 12No, remainder 11

Divisible by 100No, remainder 43

Collatz (3n + 1) trajectory

Steps to reach 1112the total stopping time

Highest value reached507,2206× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps75,143 → 225,430 → 112,715 → 338,146 → 169,073 → 507,220 → 253,610 → 126,805 → 380,416 → 190,208 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage7,514,300%

75,143% as a decimal751.43

75,143% of 10075,143

75,143% of 1,000751,430

As a fraction of 10075,143/100

Read another way

As seconds20 hours, 52 minutes and 23 seconds

As bytes73.382 KiB

As a 24-bit colour#012587

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.