Recognised as Number

59,941

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value59,941

Digit count5

Digit sum28

Digit product1,620

Multiplicative persistence2times 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 factorisation7 × 8,563

Distinct prime factors27, 8,563

Number of divisors4

Sum of divisors σ(n)68,512

Aliquot sum8,571sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)8,562the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 51,372

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

SquarefreeYesno repeated prime factor

All divisors1, 7, 8,563, 59,9414 in total

Arithmetic

Previous number59,940

Next number59,942

Double119,882

Half29,970.5

Square3,592,923,481

Cube215,363,426,374,621

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

Cube root39.135840137≈

Negation-59,941

Reciprocal0.0000166831≈

Representations

Decimal59,941

Binary111010100010010116 bits

Octal165045

HexadecimalEA25

Base 361A91

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

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

Ordinalfifty-nine thousand, nine hundred and forty-first

Scientific notation5.9941 × 10^4

Engineering notation59.941 × 10^3

In other bases

Ternary10001020001base 3; the most digit-efficient integer base after e: 11 digits

Quinary3404231base 5; one hand: 7 digits

Septenary336520base 7: 6 digits

Nonary101201base 9; each digit is two ternary digits: 6 digits

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

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

Sexagesimal16:39:1base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

1110101000100101

Bit length16 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits8within that length

Bit parityeven8 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

Bytes2ea 25

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

At each machine width

16-bit1110101000100101

32-bit00000000000000001110101000100101

64-bit0000000000000000000000000000000000000000000000001110101000100101

One's complement0001010111011010at 16 bits, every bit flipped

Bits reversed1010010001010111at 16 bits

Rotated left by 11101010001001011at 16 bits, wrapping

Shifted left by 111101010001001010= 119,882, no wrap

Shifted right by 1111010100010010= 29,970, discarding the low bit

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

Nearest landmarks

Next prime59,951+10

Previous prime59,929−12

Distance to nearest prime10

Nearest square below59,536

Nearest square above60,025

Powers & multiples

59,941 to the power 23,592,923,481

59,941 to the power 3215,363,426,374,621

59,941 to the power 412,909,099,140,321,157,361

59,941 to the power 5773,784,311,569,990,493,375,701

First ten multiples59,941, 119,882, 179,823, 239,764, 299,705, 359,646, 419,587, 479,528, 539,469, 599,410

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 1

Divisible by 6No, remainder 1

Divisible by 7Yes

Divisible by 8No, remainder 5

Divisible by 9No, remainder 1

Divisible by 10No, remainder 1

Divisible by 11No, remainder 2

Divisible by 12No, remainder 1

Divisible by 100No, remainder 41

Collatz (3n + 1) trajectory

Steps to reach 165the total stopping time

Highest value reached179,8243× the starting value

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

First steps59,941 → 179,824 → 89,912 → 44,956 → 22,478 → 11,239 → 33,718 → 16,859 → 50,578 → 25,289 → …

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

As a percentage & fraction

As a percentage5,994,100%

59,941% as a decimal599.41

59,941% of 10059,941

59,941% of 1,000599,410

As a fraction of 10059,941/100

Read another way

As seconds16 hours, 39 minutes and 1 second

As bytes58.536 KiB

As a 24-bit colour#00EA25

Keep nerding

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