Recognised as Number

41,353

Positive
Odd
Composite
5 digits

41,353 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,353

Digit count5

Digit sum16

Digit product180

Multiplicative persistence2times 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 factorisation13 × 3,181

Distinct prime factors213, 3,181

Number of divisors4

Sum of divisors σ(n)44,548

Aliquot sum3,195sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)3,180the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 38,160

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

SquarefreeYesno repeated prime factor

All divisors1, 13, 3,181, 41,3534 in total

Arithmetic

Previous number41,352

Next number41,354

Double82,706

Half20,676.5

Square1,710,070,609

Cube70,716,549,893,977

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

Cube root34.580850776≈

Negation-41,353

Reciprocal0.000024182≈

Representations

Decimal41,353

Binary101000011000100116 bits

Octal120611

HexadecimalA189

Base 36VWP

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

In wordsforty-one thousand, three hundred and fifty-three

Ordinalforty-one thousand, three hundred and fifty-third

Scientific notation4.1353 × 10^4

Engineering notation41.353 × 10^3

In other bases

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

Quinary2310403base 5; one hand: 7 digits

Septenary231364base 7: 6 digits

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

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

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

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

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

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

Bit-level

1010000110001001

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

Bytes2a1 89

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

At each machine width

16-bit1010000110001001

32-bit00000000000000001010000110001001

64-bit0000000000000000000000000000000000000000000000001010000110001001

One's complement0101111001110110at 16 bits, every bit flipped

Bits reversed1001000110000101at 16 bits

Rotated left by 10100001100010011at 16 bits, wrapping

Shifted left by 110100001100010010= 82,706, no wrap

Shifted right by 1101000011000100= 20,676, discarding the low bit

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

Nearest landmarks

Next prime41,357+4

Previous prime41,351−2

Distance to nearest prime2

Nearest square below41,209

Nearest square above41,616

Powers & multiples

41,353 to the power 21,710,070,609

41,353 to the power 370,716,549,893,977

41,353 to the power 42,924,341,487,765,630,881

41,353 to the power 5120,930,293,543,572,133,821,993

First ten multiples41,353, 82,706, 124,059, 165,412, 206,765, 248,118, 289,471, 330,824, 372,177, 413,530

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 1

Divisible by 9No, remainder 7

Divisible by 10No, remainder 3

Divisible by 11No, remainder 4

Divisible by 12No, remainder 1

Divisible by 100No, remainder 53

Collatz (3n + 1) trajectory

Steps to reach 1181the total stopping time

Highest value reached235,5285× the starting value

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

First steps41,353 → 124,060 → 62,030 → 31,015 → 93,046 → 46,523 → 139,570 → 69,785 → 209,356 → 104,678 → …

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

As a percentage & fraction

As a percentage4,135,300%

41,353% as a decimal413.53

41,353% of 10041,353

41,353% of 1,000413,530

As a fraction of 10041,353/100

Read another way

As seconds11 hours, 29 minutes and 13 seconds

As bytes40.384 KiB

As a 24-bit colour#00A189

Keep nerding

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