Nerdulator> put something in

Recognised as Number

59,377

  • Positive
  • Odd
  • Prime
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value59,377
Digit count5
Digit sum31
Digit product6,615
Multiplicative persistence3times 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 factorisation59,377
Distinct prime factors159,377
Number of divisors2
Sum of divisors σ(n)59,378
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)59,376integers below n that share no factor with it
Carmichael function λ(n)59,376the 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,3772 in total

Arithmetic

Previous number59,376
Next number59,378
Double118,754
Square root243.673962499≈irrational, shown to 9 decimal places
Cube root39.012706795≈
Negation-59,377
Reciprocal0.0000168415≈

Representations

Decimal59,377
Binary111001111111000116 bits
Octal163761
HexadecimalE7F1
Base 3619TD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty-nine thousand, three hundred and seventy-seven
Ordinalfifty-nine thousand, three hundred and seventy-seventh
Scientific notation5.9377 × 10^4
Engineering notation59.377 × 10^3

In other bases

Ternary10000110011base 3; the most digit-efficient integer base after e: 11 digits
Quinary3400002base 5; one hand: 7 digits
Septenary335053base 7: 6 digits
Nonary100404base 9; each digit is two ternary digits: 6 digits
Duodecimal2a441base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal788hbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal16:29:37base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary10000110011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011100000110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1110011111110001
Bit length16 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits5within that length
Bit parityodd11 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
Bytes2e7 f1
Gray code1001010000001001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1110011111110001
32-bit00000000000000001110011111110001
64-bit0000000000000000000000000000000000000000000000001110011111110001
One's complement0001100000001110at 16 bits, every bit flipped
Bits reversed1000111111100111at 16 bits
Rotated left by 11100111111100011at 16 bits, wrapping
Shifted left by 111100111111100010= 118,754, no wrap
Shifted right by 1111001111111000= 29,688, discarding the low bit
These bits as a double2.93361359 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime59,387+10
Previous prime59,369−8
Distance to nearest prime0, it is prime
Nearest square below59,049
Nearest square above59,536

Powers & multiples

59,377 to the power 23,525,628,129
59,377 to the power 3209,341,221,415,633
59,377 to the power 412,430,053,703,996,040,641
59,377 to the power 5738,059,298,782,172,905,140,657
First ten multiples59,377, 118,754, 178,131, 237,508, 296,885, 356,262, 415,639, 475,016, 534,393, 593,770
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 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11No, remainder 10
Divisible by 12No, remainder 1
Divisible by 100No, remainder 77

Collatz (3n + 1) trajectory

Steps to reach 1122the total stopping time
Highest value reached178,1323× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps59,377 → 178,132 → 89,066 → 44,533 → 133,600 → 66,800 → 33,400 → 16,700 → 8,350 → 4,175 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage5,937,700%
59,377% as a decimal593.77
59,377% of 10059,377
59,377% of 1,000593,770
As a fraction of 10059,377/100

Read another way

As bytes57.985 KiB
As a 24-bit colour#00E7F1

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