Nerdulator> put something in

Recognised as Number

41,248

  • Positive
  • Even
  • Composite
  • 5 digits

41,248 is an even 5-digit integer and a composite number. It has 12 divisors and a digital root of 1.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value41,248
Digit count5
Digit sum19
Digit product256
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^5 × 1,289
Distinct prime factors22, 1,289
Number of divisors12
Sum of divisors σ(n)81,270
Aliquot sum40,022sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)20,608integers below n that share no factor with it
Carmichael function λ(n)1,288the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 20,608
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 16, 32, 1,289, 2,578, 5,156, 10,312, 20,624, 41,24812 in total

Arithmetic

Previous number41,247
Next number41,249
Double82,496
Half20,624
Square root203.096036397≈irrational, shown to 9 decimal places
Cube root34.551557723≈
Negation-41,248
Reciprocal0.0000242436≈

Representations

Decimal41,248
Binary101000010010000016 bits
Octal120440
HexadecimalA120
Base 36VTS
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsforty-one thousand, two hundred and forty-eight
Ordinalforty-one thousand, two hundred and forty-eighth
Scientific notation4.1248 × 10^4
Engineering notation41.248 × 10^3

In other bases

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

Bit-level

1010000100100000
Bit length16 bitsto write the magnitude
Set bits4the population count, or Hamming weight
Zero bits12within that length
Bit parityeven4 set bits, so even; not the same as the number itself being even
Highest set bitbit 15worth 32,768
Lowest set bitbit 55 trailing zeros
Power of twoNo
Bytes2a1 20
Gray code1111000110110000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1010000100100000
32-bit00000000000000001010000100100000
64-bit0000000000000000000000000000000000000000000000001010000100100000
One's complement0101111011011111at 16 bits, every bit flipped
Bits reversed0000010010000101at 16 bits
Rotated left by 10100001001000001at 16 bits, wrapping
Shifted left by 110100001001000000= 82,496, no wrap
Shifted right by 1101000010010000= 20,624, discarding the low bit
These bits as a double2.03792198 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime41,257+9
Previous prime41,243−5
Distance to nearest prime5
Nearest square below41,209
Nearest square above41,616

Powers & multiples

41,248 to the power 21,701,397,504
41,248 to the power 370,179,244,244,992
41,248 to the power 42,894,753,466,617,430,016
41,248 to the power 5119,402,790,991,035,753,299,968
First ten multiples41,248, 82,496, 123,744, 164,992, 206,240, 247,488, 288,736, 329,984, 371,232, 412,480
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1150the total stopping time
Highest value reached41,248
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps41,248 → 20,624 → 10,312 → 5,156 → 2,578 → 1,289 → 3,868 → 1,934 → 967 → 2,902 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage4,124,800%
41,248% as a decimal412.48
41,248% of 10041,248
41,248% of 1,000412,480
As a fraction of 10041,248/100

Read another way

As bytes40.281 KiB
As a 24-bit colour#00A120

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