Recognised as Number

41,279

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value41,279

Digit count5

Digit sum23

Digit product504

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

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation7 × 5,897

Distinct prime factors27, 5,897

Number of divisors4

Sum of divisors σ(n)47,184

Aliquot sum5,905sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)17,688the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 35,376

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 7, 5,897, 41,2794 in total

Arithmetic

Previous number41,278

Next number41,280

Double82,558

Half20,639.5

Square1,703,955,841

Cube70,337,593,160,639

Square root203.172340637≈irrational, shown to 9 decimal places

Cube root34.560211315≈

Negation-41,279

Reciprocal0.0000242254≈

Representations

Decimal41,279

Binary101000010011111116 bits

Octal120477

HexadecimalA13F

Base 36VUN

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

In wordsforty-one thousand, two hundred and seventy-nine

Ordinalforty-one thousand, two hundred and seventy-ninth

Scientific notation4.1279 × 10^4

Engineering notation41.279 × 10^3

In other bases

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

Quinary2310104base 5; one hand: 7 digits

Septenary231230base 7: 6 digits

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

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

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

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

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

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

Bit-level

1010000100111111

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

Bytes2a1 3f

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

At each machine width

16-bit1010000100111111

32-bit00000000000000001010000100111111

64-bit0000000000000000000000000000000000000000000000001010000100111111

One's complement0101111011000000at 16 bits, every bit flipped

Bits reversed1111110010000101at 16 bits

Rotated left by 10100001001111111at 16 bits, wrapping

Shifted left by 110100001001111110= 82,558, no wrap

Shifted right by 1101000010011111= 20,639, discarding the low bit

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

Nearest landmarks

Next prime41,281+2

Previous prime41,269−10

Distance to nearest prime2

Nearest square below41,209

Nearest square above41,616

Powers & multiples

41,279 to the power 21,703,955,841

41,279 to the power 370,337,593,160,639

41,279 to the power 42,903,465,508,078,017,281

41,279 to the power 5119,852,152,707,952,475,342,399

First ten multiples41,279, 82,558, 123,837, 165,116, 206,395, 247,674, 288,953, 330,232, 371,511, 412,790

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 3

Divisible by 5No, remainder 4

Divisible by 6No, remainder 5

Divisible by 7Yes

Divisible by 8No, remainder 7

Divisible by 9No, remainder 5

Divisible by 10No, remainder 9

Divisible by 11No, remainder 7

Divisible by 12No, remainder 11

Divisible by 100No, remainder 79

Collatz (3n + 1) trajectory

Steps to reach 1119the total stopping time

Highest value reached1,357,28832× the starting value

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

First steps41,279 → 123,838 → 61,919 → 185,758 → 92,879 → 278,638 → 139,319 → 417,958 → 208,979 → 626,938 → …

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

As a percentage & fraction

As a percentage4,127,900%

41,279% as a decimal412.79

41,279% of 10041,279

41,279% of 1,000412,790

As a fraction of 10041,279/100

Read another way

As seconds11 hours, 27 minutes and 59 seconds

As bytes40.312 KiB

As a 24-bit colour#00A13F

Keep nerding

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