Nerdulator> put something in

Recognised as Number

41,731

  • Positive
  • Odd
  • Composite
  • 5 digits

41,731 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 7.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value41,731
Digit count5
Digit sum16
Digit product84
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation29 × 1,439
Distinct prime factors229, 1,439
Number of divisors4
Sum of divisors σ(n)43,200
Aliquot sum1,469sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)40,264integers below n that share no factor with it
Carmichael function λ(n)20,132the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 40,264
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 29, 1,439, 41,7314 in total

Arithmetic

Previous number41,730
Next number41,732
Double83,462
Square root204.281668292≈irrational, shown to 9 decimal places
Cube root34.685897039≈
Negation-41,731
Reciprocal0.000023963≈

Representations

Decimal41,731
Binary101000110000001116 bits
Octal121403
HexadecimalA303
Base 36W77
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsforty-one thousand, seven hundred and thirty-one
Ordinalforty-one thousand, seven hundred and thirty-first
Scientific notation4.1731 × 10^4
Engineering notation41.731 × 10^3

In other bases

Ternary2010020121base 3; the most digit-efficient integer base after e: 10 digits
Quinary2313411base 5; one hand: 7 digits
Septenary232444base 7: 6 digits
Nonary63217base 9; each digit is two ternary digits: 5 digits
Duodecimal20197base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal546bbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal11:35:31base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1T0101T1TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110011100000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1010001100000011
Bit length16 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits10within that length
Bit parityeven6 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 03
Gray code1111001010000010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1010001100000011
32-bit00000000000000001010001100000011
64-bit0000000000000000000000000000000000000000000000001010001100000011
One's complement0101110011111100at 16 bits, every bit flipped
Bits reversed1100000011000101at 16 bits
Rotated left by 10100011000000111at 16 bits, wrapping
Shifted left by 110100011000000110= 83,462, no wrap
Shifted right by 1101000110000001= 20,865, discarding the low bit
These bits as a double2.06178535 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime41,737+6
Previous prime41,729−2
Distance to nearest prime2
Nearest square below41,616
Nearest square above42,025

Powers & multiples

41,731 to the power 21,741,476,361
41,731 to the power 372,673,550,020,891
41,731 to the power 43,032,739,915,921,802,321
41,731 to the power 5126,559,269,431,332,732,657,651
First ten multiples41,731, 83,462, 125,193, 166,924, 208,655, 250,386, 292,117, 333,848, 375,579, 417,310
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 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11No, remainder 8
Divisible by 12No, remainder 7
Divisible by 100No, remainder 31

Collatz (3n + 1) trajectory

Steps to reach 1150the total stopping time
Highest value reached187,7924× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps41,731 → 125,194 → 62,597 → 187,792 → 93,896 → 46,948 → 23,474 → 11,737 → 35,212 → 17,606 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage4,173,100%
41,731% as a decimal417.31
41,731% of 10041,731
41,731% of 1,000417,310
As a fraction of 10041,731/100

Read another way

As bytes40.753 KiB
As a 24-bit colour#00A303

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 “41731” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.