Nerdulator> put something in

Recognised as Number

41,249

  • Positive
  • Odd
  • Composite
  • 5 digits

41,249 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value41,249
Digit count5
Digit sum20
Digit product288
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation13 × 19 × 167
Distinct prime factors313, 19, 167
Number of divisors8
Sum of divisors σ(n)47,040
Aliquot sum5,791sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)35,856integers below n that share no factor with it
Carmichael function λ(n)2,988the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 35,856
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 13, 19, 167, 247, 2,171, 3,173, 41,2498 in total

Arithmetic

Previous number41,248
Next number41,250
Double82,498
Square root203.098498271≈irrational, shown to 9 decimal places
Cube root34.551836939≈
Negation-41,249
Reciprocal0.000024243≈

Representations

Decimal41,249
Binary101000010010000116 bits
Octal120441
HexadecimalA121
Base 36VTT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsforty-one thousand, two hundred and forty-nine
Ordinalforty-one thousand, two hundred and forty-ninth
Scientific notation4.1249 × 10^4
Engineering notation41.249 × 10^3

In other bases

Ternary2002120202base 3; the most digit-efficient integer base after e: 10 digits
Quinary2304444base 5; one hand: 7 digits
Septenary231155base 7: 6 digits
Nonary62522base 9; each digit is two ternary digits: 5 digits
Duodecimal1ba55base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal5329base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal11:27:29base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1T010TT1T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110000101100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1010000100100001
Bit length16 bitsto write the magnitude
Set bits5the population count, or Hamming weight
Zero bits11within that length
Bit parityodd5 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
Bytes2a1 21
Gray code1111000110110001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1010000100100001
32-bit00000000000000001010000100100001
64-bit0000000000000000000000000000000000000000000000001010000100100001
One's complement0101111011011110at 16 bits, every bit flipped
Bits reversed1000010010000101at 16 bits
Rotated left by 10100001001000011at 16 bits, wrapping
Shifted left by 110100001001000010= 82,498, no wrap
Shifted right by 1101000010010000= 20,624, discarding the low bit
These bits as a double2.03797138 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime41,257+8
Previous prime41,243−6
Distance to nearest prime6
Nearest square below41,209
Nearest square above41,616

Powers & multiples

41,249 to the power 21,701,480,001
41,249 to the power 370,184,348,561,249
41,249 to the power 42,895,034,193,802,960,001
41,249 to the power 5119,417,265,460,178,297,081,249
First ten multiples41,249, 82,498, 123,747, 164,996, 206,245, 247,494, 288,743, 329,992, 371,241, 412,490
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 188the total stopping time
Highest value reached123,7483× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps41,249 → 123,748 → 61,874 → 30,937 → 92,812 → 46,406 → 23,203 → 69,610 → 34,805 → 104,416 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage4,124,900%
41,249% as a decimal412.49
41,249% of 10041,249
41,249% of 1,000412,490
As a fraction of 10041,249/100

Read another way

As bytes40.282 KiB
As a 24-bit colour#00A121

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