Nerdulator> put something in

Recognised as Number

59,442

  • Positive
  • Even
  • Composite
  • 5 digits

59,442 is an even 5-digit integer and a composite number. It has 8 divisors and a digital root of 6.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value59,442
Digit count5
Digit sum24
Digit product1,440
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3 × 9,907
Distinct prime factors32, 3, 9,907
Number of divisors8
Sum of divisors σ(n)118,896
Aliquot sum59,454sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)19,812integers below n that share no factor with it
Carmichael function λ(n)9,906the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 19,812
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 3, 6, 9,907, 19,814, 29,721, 59,4428 in total

Arithmetic

Previous number59,441
Next number59,443
Double118,884
Half29,721
Square root243.807300957≈irrational, shown to 9 decimal places
Cube root39.02693734≈
Negation-59,442
Reciprocal0.0000168231≈

Representations

Decimal59,442
Binary111010000011001016 bits
Octal164062
HexadecimalE832
Base 3619V6
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty-nine thousand, four hundred and forty-two
Ordinalfifty-nine thousand, four hundred and forty-second
Scientific notation5.9442 × 10^4
Engineering notation59.442 × 10^3

In other bases

Ternary10000112120base 3; the most digit-efficient integer base after e: 11 digits
Quinary3400232base 5; one hand: 7 digits
Septenary335205base 7: 6 digits
Nonary100476base 9; each digit is two ternary digits: 6 digits
Duodecimal2a496base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal78c2base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal16:30:42base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary10001TT0TT0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011100001110110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1110100000110010
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 even
Highest set bitbit 15worth 32,768
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes2e8 32
Gray code1001110000101011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1110100000110010
32-bit00000000000000001110100000110010
64-bit0000000000000000000000000000000000000000000000001110100000110010
One's complement0001011111001101at 16 bits, every bit flipped
Bits reversed0100110000010111at 16 bits
Rotated left by 11101000001100101at 16 bits, wrapping
Shifted left by 111101000001100100= 118,884, no wrap
Shifted right by 1111010000011001= 29,721, discarding the low bit
These bits as a double2.93682501 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime59,443+1
Previous prime59,441−1
Distance to nearest prime1
Nearest square below59,049
Nearest square above59,536

Powers & multiples

59,442 to the power 23,533,351,364
59,442 to the power 3210,029,471,778,888
59,442 to the power 412,484,571,861,480,660,496
59,442 to the power 5742,107,920,590,133,421,203,232
First ten multiples59,442, 118,884, 178,326, 237,768, 297,210, 356,652, 416,094, 475,536, 534,978, 594,420
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6Yes
Divisible by 7No, remainder 5
Divisible by 8No, remainder 2
Divisible by 9No, remainder 6
Divisible by 10No, remainder 2
Divisible by 11No, remainder 9
Divisible by 12No, remainder 6
Divisible by 100No, remainder 42

Collatz (3n + 1) trajectory

Steps to reach 1148the total stopping time
Highest value reached2,316,76038× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps59,442 → 29,721 → 89,164 → 44,582 → 22,291 → 66,874 → 33,437 → 100,312 → 50,156 → 25,078 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage5,944,200%
59,442% as a decimal594.42
59,442% of 10059,442
59,442% of 1,000594,420
As a fraction of 10059,442/100

Read another way

As bytes58.049 KiB
As a 24-bit colour#00E832

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “59442” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.