Nerdulator> put something in

Recognised as Number

59,440

  • Positive
  • Even
  • Composite
  • 5 digits

59,440 is an even 5-digit integer and a composite number. It has 20 divisors and a digital root of 4.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value59,440
Digit count5
Digit sum22
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation2^4 × 5 × 743
Distinct prime factors32, 5, 743
Number of divisors20
Sum of divisors σ(n)138,384
Aliquot sum78,944sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)23,744integers below n that share no factor with it
Carmichael function λ(n)1,484the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 23,744
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 5, 8, 10, 16, 20, 40, 80, 743, 1,486, 2,972, 3,715, 5,944, 7,430, 11,888, 14,860, 29,720, 59,44020 in total

Arithmetic

Previous number59,439
Next number59,441
Double118,880
Half29,720
Square root243.803199323≈irrational, shown to 9 decimal places
Cube root39.026499632≈
Negation-59,440
Reciprocal0.0000168237≈

Representations

Decimal59,440
Binary111010000011000016 bits
Octal164060
HexadecimalE830
Base 3619V4
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty-nine thousand, four hundred and forty
Ordinalfifty-nine thousand, four hundred and fortieth
Scientific notation5.944 × 10^4
Engineering notation59.44 × 10^3

In other bases

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

Bit-level

1110100000110000
Bit length16 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits10within that length
Bit parityeven6 set bits, so even; not the same as the number itself being even
Highest set bitbit 15worth 32,768
Lowest set bitbit 44 trailing zeros
Power of twoNo
Bytes2e8 30
Gray code1001110000101000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1110100000110000
32-bit00000000000000001110100000110000
64-bit0000000000000000000000000000000000000000000000001110100000110000
One's complement0001011111001111at 16 bits, every bit flipped
Bits reversed0000110000010111at 16 bits
Rotated left by 11101000001100001at 16 bits, wrapping
Shifted left by 111101000001100000= 118,880, no wrap
Shifted right by 1111010000011000= 29,720, discarding the low bit
These bits as a double2.9367262 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

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

Powers & multiples

59,440 to the power 23,533,113,600
59,440 to the power 3210,008,272,384,000
59,440 to the power 412,482,891,710,504,960,000
59,440 to the power 5741,983,083,272,414,822,400,000
First ten multiples59,440, 118,880, 178,320, 237,760, 297,200, 356,640, 416,080, 475,520, 534,960, 594,400
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 142the total stopping time
Highest value reached59,440
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps59,440 → 29,720 → 14,860 → 7,430 → 3,715 → 11,146 → 5,573 → 16,720 → 8,360 → 4,180 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage5,944,000%
59,440% as a decimal594.4
59,440% of 10059,440
59,440% of 1,000594,400
As a fraction of 10059,440/100

Read another way

As bytes58.047 KiB
As a 24-bit colour#00E830

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