Nerdulator> put something in

Recognised as Number

60,590

  • Positive
  • Even
  • Composite
  • 5 digits

60,590 is an even 5-digit integer and a composite number. It has 16 divisors and a digital root of 2.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value60,590
Digit count5
Digit sum20
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 5 × 73 × 83
Distinct prime factors42, 5, 73, 83
Number of divisors16
Sum of divisors σ(n)111,888
Aliquot sum51,298sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)23,616integers below n that share no factor with it
Carmichael function λ(n)2,952the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 23,616
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 5, 10, 73, 83, 146, 166, 365, 415, 730, 830, 6,059, 12,118, 30,295, 60,59016 in total

Arithmetic

Previous number60,589
Next number60,591
Double121,180
Half30,295
Square root246.150360552≈irrational, shown to 9 decimal places
Cube root39.276578749≈
Negation-60,590
Reciprocal0.0000165044≈

Representations

Decimal60,590
Binary111011001010111016 bits
Octal166256
HexadecimalECAE
Base 361AR2
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixty thousand, five hundred and ninety
Ordinalsixty thousand, five hundred and ninetieth
Scientific notation6.059 × 10^4
Engineering notation60.59 × 10^3

In other bases

Ternary10002010002base 3; the most digit-efficient integer base after e: 11 digits
Quinary3414330base 5; one hand: 7 digits
Septenary341435base 7: 6 digits
Nonary102102base 9; each digit is two ternary digits: 6 digits
Duodecimal2b092base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal7b9abase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal16:49:50base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1001T01001Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011110111110010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1110110010101110
Bit length16 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits6within that length
Bit parityeven10 set bits, so even; not the same as the number itself being even
Highest set bitbit 15worth 32,768
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes2ec ae
Gray code1001101011111001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1110110010101110
32-bit00000000000000001110110010101110
64-bit0000000000000000000000000000000000000000000000001110110010101110
One's complement0001001101010001at 16 bits, every bit flipped
Bits reversed0111010100110111at 16 bits
Rotated left by 11101100101011101at 16 bits, wrapping
Shifted left by 111101100101011100= 121,180, no wrap
Shifted right by 1111011001010111= 30,295, discarding the low bit
These bits as a double2.99354375 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime60,601+11
Previous prime60,589−1
Distance to nearest prime1
Nearest square below60,516
Nearest square above61,009

Powers & multiples

60,590 to the power 23,671,148,100
60,590 to the power 3222,434,863,379,000
60,590 to the power 413,477,328,372,133,610,000
60,590 to the power 5816,591,326,067,575,429,900,000
First ten multiples60,590, 121,180, 181,770, 242,360, 302,950, 363,540, 424,130, 484,720, 545,310, 605,900
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 186the total stopping time
Highest value reached204,4963× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps60,590 → 30,295 → 90,886 → 45,443 → 136,330 → 68,165 → 204,496 → 102,248 → 51,124 → 25,562 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage6,059,000%
60,590% as a decimal605.9
60,590% of 10060,590
60,590% of 1,000605,900
As a fraction of 10060,590/100

Read another way

As bytes59.17 KiB
As a 24-bit colour#00ECAE

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