Nerdulator> put something in

Recognised as Number

41,773

  • Positive
  • Odd
  • Composite
  • 5 digits

41,773 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 value41,773
Digit count5
Digit sum22
Digit product588
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 factorisation37 × 1,129
Distinct prime factors237, 1,129
Number of divisors4
Sum of divisors σ(n)42,940
Aliquot sum1,167sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)40,608integers below n that share no factor with it
Carmichael function λ(n)3,384the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 40,608
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 37, 1,129, 41,7734 in total

Arithmetic

Previous number41,772
Next number41,774
Double83,546
Square root204.384441678≈irrational, shown to 9 decimal places
Cube root34.697529632≈
Negation-41,773
Reciprocal0.0000239389≈

Representations

Decimal41,773
Binary101000110010110116 bits
Octal121455
HexadecimalA32D
Base 36W8D
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsforty-one thousand, seven hundred and seventy-three
Ordinalforty-one thousand, seven hundred and seventy-third
Scientific notation4.1773 × 10^4
Engineering notation41.773 × 10^3

In other bases

Ternary2010022011base 3; the most digit-efficient integer base after e: 10 digits
Quinary2314043base 5; one hand: 7 digits
Septenary232534base 7: 6 digits
Nonary63264base 9; each digit is two ternary digits: 5 digits
Duodecimal20211base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal548dbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal11:36:13base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1T01010T011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110011101111101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1010001100101101
Bit length16 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits8within that length
Bit parityeven8 set bits, so even; 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 2d
Gray code1111001010111011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1010001100101101
32-bit00000000000000001010001100101101
64-bit0000000000000000000000000000000000000000000000001010001100101101
One's complement0101110011010010at 16 bits, every bit flipped
Bits reversed1011010011000101at 16 bits
Rotated left by 10100011001011011at 16 bits, wrapping
Shifted left by 110100011001011010= 83,546, no wrap
Shifted right by 1101000110010110= 20,886, discarding the low bit
These bits as a double2.06386042 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime41,777+4
Previous prime41,771−2
Distance to nearest prime2
Nearest square below41,616
Nearest square above42,025

Powers & multiples

41,773 to the power 21,744,983,529
41,773 to the power 372,893,196,956,917
41,773 to the power 43,044,967,516,481,293,841
41,773 to the power 5127,197,428,065,973,087,620,093
First ten multiples41,773, 83,546, 125,319, 167,092, 208,865, 250,638, 292,411, 334,184, 375,957, 417,730
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 5
Divisible by 9No, remainder 4
Divisible by 10No, remainder 3
Divisible by 11No, remainder 6
Divisible by 12No, remainder 1
Divisible by 100No, remainder 73

Collatz (3n + 1) trajectory

Steps to reach 162the total stopping time
Highest value reached125,3203× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps41,773 → 125,320 → 62,660 → 31,330 → 15,665 → 46,996 → 23,498 → 11,749 → 35,248 → 17,624 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage4,177,300%
41,773% as a decimal417.73
41,773% of 10041,773
41,773% of 1,000417,730
As a fraction of 10041,773/100

Read another way

As bytes40.794 KiB
As a 24-bit colour#00A32D

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “41773” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.