Recognised as Number

41,775

Positive
Odd
Composite
5 digits

41,775 is an odd 5-digit integer and a composite number. It has 12 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value41,775

Digit count5

Digit sum24

Digit product980

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 5^2 × 557

Distinct prime factors33, 5, 557

Number of divisors12

Sum of divisors σ(n)69,192

Aliquot sum27,417sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)2,780the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 22,240

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 3, 5, 15, 25, 75, 557, 1,671, 2,785, 8,355, 13,925, 41,77512 in total

Arithmetic

Previous number41,774

Next number41,776

Double83,550

Half20,887.5

Square1,745,150,625

Cube72,903,667,359,375

Square root204.38933436≈irrational, shown to 9 decimal places

Cube root34.698083371≈

Negation-41,775

Reciprocal0.0000239378≈

Representations

Decimal41,775

Binary101000110010111116 bits

Octal121457

HexadecimalA32F

Base 36W8F

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

In wordsforty-one thousand, seven hundred and seventy-five

Ordinalforty-one thousand, seven hundred and seventy-fifth

Scientific notation4.1775 × 10^4

Engineering notation41.775 × 10^3

In other bases

Ternary2010022020base 3; the most digit-efficient integer base after e: 10 digits

Quinary2314100base 5; one hand: 7 digits

Septenary232536base 7: 6 digits

Nonary63266base 9; each digit is two ternary digits: 5 digits

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

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

Sexagesimal11:36:15base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

1010001100101111

Bit length16 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits7within that length

Bit parityodd9 set bits, so odd; not the same as the number itself being odd

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes2a3 2f

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

At each machine width

16-bit1010001100101111

32-bit00000000000000001010001100101111

64-bit0000000000000000000000000000000000000000000000001010001100101111

One's complement0101110011010000at 16 bits, every bit flipped

Bits reversed1111010011000101at 16 bits

Rotated left by 10100011001011111at 16 bits, wrapping

Shifted left by 110100011001011110= 83,550, no wrap

Shifted right by 1101000110010111= 20,887, discarding the low bit

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

Nearest landmarks

Next prime41,777+2

Previous prime41,771−4

Distance to nearest prime2

Nearest square below41,616

Nearest square above42,025

Powers & multiples

41,775 to the power 21,745,150,625

41,775 to the power 372,903,667,359,375

41,775 to the power 43,045,550,703,937,890,625

41,775 to the power 5127,227,880,657,005,380,859,375

First ten multiples41,775, 83,550, 125,325, 167,100, 208,875, 250,650, 292,425, 334,200, 375,975, 417,750

Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 3

Divisible by 5Yes

Divisible by 6No, remainder 3

Divisible by 7No, remainder 6

Divisible by 8No, remainder 7

Divisible by 9No, remainder 6

Divisible by 10No, remainder 5

Divisible by 11No, remainder 8

Divisible by 12No, remainder 3

Divisible by 100No, remainder 75

Collatz (3n + 1) trajectory

Steps to reach 162the total stopping time

Highest value reached422,98010× the starting value

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

First steps41,775 → 125,326 → 62,663 → 187,990 → 93,995 → 281,986 → 140,993 → 422,980 → 211,490 → 105,745 → …

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

As a percentage & fraction

As a percentage4,177,500%

41,775% as a decimal417.75

41,775% of 10041,775

41,775% of 1,000417,750

As a fraction of 10041,775/100

Read another way

As seconds11 hours, 36 minutes and 15 seconds

As bytes40.796 KiB

As a 24-bit colour#00A32F

Keep nerding

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