Recognised as Number

41,305

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value41,305

Digit count5

Digit sum13

Digit product0zero, because one of the digits is zero

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5 × 11 × 751

Distinct prime factors35, 11, 751

Number of divisors8

Sum of divisors σ(n)54,144

Aliquot sum12,839sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,500the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 30,000

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 5, 11, 55, 751, 3,755, 8,261, 41,3058 in total

Arithmetic

Previous number41,304

Next number41,306

Double82,610

Half20,652.5

Square1,706,103,025

Cube70,470,585,447,625

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

Cube root34.567465826≈

Negation-41,305

Reciprocal0.0000242101≈

Representations

Decimal41,305

Binary101000010101100116 bits

Octal120531

HexadecimalA159

Base 36VVD

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

In wordsforty-one thousand, three hundred and five

Ordinalforty-one thousand, three hundred and fifth

Scientific notation4.1305 × 10^4

Engineering notation41.305 × 10^3

In other bases

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

Quinary2310210base 5; one hand: 7 digits

Septenary231265base 7: 6 digits

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

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

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

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

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

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

Bit-level

1010000101011001

Bit length16 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits9within that length

Bit parityodd7 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 59

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

At each machine width

16-bit1010000101011001

32-bit00000000000000001010000101011001

64-bit0000000000000000000000000000000000000000000000001010000101011001

One's complement0101111010100110at 16 bits, every bit flipped

Bits reversed1001101010000101at 16 bits

Rotated left by 10100001010110011at 16 bits, wrapping

Shifted left by 110100001010110010= 82,610, no wrap

Shifted right by 1101000010101100= 20,652, discarding the low bit

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

Nearest landmarks

Next prime41,333+28

Previous prime41,299−6

Distance to nearest prime6

Nearest square below41,209

Nearest square above41,616

Powers & multiples

41,305 to the power 21,706,103,025

41,305 to the power 370,470,585,447,625

41,305 to the power 42,910,787,531,914,150,625

41,305 to the power 5120,230,079,005,713,991,565,625

First ten multiples41,305, 82,610, 123,915, 165,220, 206,525, 247,830, 289,135, 330,440, 371,745, 413,050

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 5Yes

Divisible by 6No, remainder 1

Divisible by 7No, remainder 5

Divisible by 8No, remainder 1

Divisible by 9No, remainder 4

Divisible by 10No, remainder 5

Divisible by 11Yes

Divisible by 12No, remainder 1

Divisible by 100No, remainder 5

Collatz (3n + 1) trajectory

Steps to reach 1150the total stopping time

Highest value reached139,4083× the starting value

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

First steps41,305 → 123,916 → 61,958 → 30,979 → 92,938 → 46,469 → 139,408 → 69,704 → 34,852 → 17,426 → …

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

As a percentage & fraction

As a percentage4,130,500%

41,305% as a decimal413.05

41,305% of 10041,305

41,305% of 1,000413,050

As a fraction of 10041,305/100

Read another way

As seconds11 hours, 28 minutes and 25 seconds

As bytes40.337 KiB

As a 24-bit colour#00A159

Keep nerding

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