Number

59,841

Positive
Odd
Composite
5 digits

59,841 is an odd 5-digit integer and a composite number. It has 12 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value59,841

Digit count5

Digit sum27

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 61 × 109

Distinct prime factors33, 61, 109

Number of divisors12

Sum of divisors σ(n)88,660

Aliquot sum28,819sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

SquarefreeNohas a repeated prime factor

All divisors1, 3, 9, 61, 109, 183, 327, 549, 981, 6,649, 19,947, 59,84112 in total

Arithmetic

Previous number59,840

Next number59,842

Double119,682

Half29,920.5

Square3,580,945,281

Cube214,287,346,560,321

Square root244.624201583≈irrational, shown to 9 decimal places

Cube root39.114064489≈

Negation-59,841

Reciprocal0.000016711≈

Representations

Decimal59,841

Binary111010011100000116 bits

Octal164701

HexadecimalE9C1

Base 361A69

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

In wordsfifty-nine thousand, eight hundred and forty-one

Ordinalfifty-nine thousand, eight hundred and forty-first

Scientific notation5.9841 × 10^4

Engineering notation59.841 × 10^3

Nearest landmarks

Next prime59,863+22

Previous prime59,833−8

Distance to nearest prime8

Nearest square below59,536

Nearest square above60,025

Powers & multiples

59,841 to the power 23,580,945,281

59,841 to the power 3214,287,346,560,321

59,841 to the power 412,823,169,105,516,168,961

59,841 to the power 5767,351,262,443,193,066,795,201

First ten multiples59,841, 119,682, 179,523, 239,364, 299,205, 359,046, 418,887, 478,728, 538,569, 598,410

Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5No, remainder 1

Divisible by 6No, remainder 3

Divisible by 7No, remainder 5

Divisible by 8No, remainder 1

Divisible by 9Yes

Divisible by 10No, remainder 1

Divisible by 11No, remainder 1

Divisible by 12No, remainder 9

Divisible by 100No, remainder 41

Collatz (3n + 1) trajectory

Steps to reach 1117the total stopping time

Highest value reached345,5445× the starting value

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

First steps59,841 → 179,524 → 89,762 → 44,881 → 134,644 → 67,322 → 33,661 → 100,984 → 50,492 → 25,246 → …

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

As a percentage & fraction

As a percentage5,984,100%

59,841% as a decimal598.41

59,841% of 10059,841

59,841% of 1,000598,410

As a fraction of 10059,841/100

Read another way

As seconds16 hours, 37 minutes and 21 seconds

As bytes58.438 KiB

As a 24-bit colour#00E9C1

Keep nerding

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