Nerdulator> put something in

Recognised as Number

59,443

  • Positive
  • Odd
  • Prime
  • 5 digits

59,443 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 7.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value59,443
Digit count5
Digit sum25
Digit product2,160
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 factorisation59,443
Distinct prime factors159,443
Number of divisors2
Sum of divisors σ(n)59,444
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)59,442integers below n that share no factor with it
Carmichael function λ(n)59,442the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 59,4432 in total

Arithmetic

Previous number59,442
Next number59,444
Double118,886
Square root243.809351748≈irrational, shown to 9 decimal places
Cube root39.027156191≈
Negation-59,443
Reciprocal0.0000168228≈

Representations

Decimal59,443
Binary111010000011001116 bits
Octal164063
HexadecimalE833
Base 3619V7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty-nine thousand, four hundred and forty-three
Ordinalfifty-nine thousand, four hundred and forty-third
Scientific notation5.9443 × 10^4
Engineering notation59.443 × 10^3

In other bases

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

Bit-level

1110100000110011
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
Bytes2e8 33
Gray code1001110000101010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1110100000110011
32-bit00000000000000001110100000110011
64-bit0000000000000000000000000000000000000000000000001110100000110011
One's complement0001011111001100at 16 bits, every bit flipped
Bits reversed1100110000010111at 16 bits
Rotated left by 11101000001100111at 16 bits, wrapping
Shifted left by 111101000001100110= 118,886, no wrap
Shifted right by 1111010000011001= 29,721, discarding the low bit
These bits as a double2.93687442 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime59,447+4
Previous prime59,441−2
Distance to nearest prime0, it is prime
Nearest square below59,049
Nearest square above59,536

Powers & multiples

59,443 to the power 23,533,470,249
59,443 to the power 3210,040,072,011,307
59,443 to the power 412,485,412,000,568,122,001
59,443 to the power 5742,170,345,549,770,876,105,443
First ten multiples59,443, 118,886, 178,329, 237,772, 297,215, 356,658, 416,101, 475,544, 534,987, 594,430
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 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 3
Divisible by 11No, remainder 10
Divisible by 12No, remainder 7
Divisible by 100No, remainder 43

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,443 → 178,330 → 89,165 → 267,496 → 133,748 → 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,300%
59,443% as a decimal594.43
59,443% of 10059,443
59,443% of 1,000594,430
As a fraction of 10059,443/100

Read another way

As bytes58.05 KiB
As a 24-bit colour#00E833

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 “59443” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.