Nerdulator> put something in

Recognised as Number

61,590

  • Positive
  • Even
  • Composite
  • 5 digits

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

Number properties

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

Factors & divisors

Prime factorisation2 × 3 × 5 × 2,053
Distinct prime factors42, 3, 5, 2,053
Number of divisors16
Sum of divisors σ(n)147,888
Aliquot sum86,298sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)16,416integers below n that share no factor with it
Carmichael function λ(n)2,052the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 16,416
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 3, 5, 6, 10, 15, 30, 2,053, 4,106, 6,159, 10,265, 12,318, 20,530, 30,795, 61,59016 in total

Arithmetic

Previous number61,589
Next number61,591
Double123,180
Half30,795
Square root248.173326528≈irrational, shown to 9 decimal places
Cube root39.491479228≈
Negation-61,590
Reciprocal0.0000162364≈

Representations

Decimal61,590
Binary111100001001011016 bits
Octal170226
HexadecimalF096
Base 361BIU
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixty-one thousand, five hundred and ninety
Ordinalsixty-one thousand, five hundred and ninetieth
Scientific notation6.159 × 10^4
Engineering notation61.59 × 10^3

In other bases

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

Bit-level

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

At each machine width

16-bit1111000010010110
32-bit00000000000000001111000010010110
64-bit0000000000000000000000000000000000000000000000001111000010010110
One's complement0000111101101001at 16 bits, every bit flipped
Bits reversed0110100100001111at 16 bits
Rotated left by 11110000100101101at 16 bits, wrapping
Shifted left by 111110000100101100= 123,180, no wrap
Shifted right by 1111100001001011= 30,795, discarding the low bit
These bits as a double3.04295031 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime61,603+13
Previous prime61,583−7
Distance to nearest prime7
Nearest square below61,504
Nearest square above62,001

Powers & multiples

61,590 to the power 23,793,328,100
61,590 to the power 3233,631,077,679,000
61,590 to the power 414,389,338,074,249,610,000
61,590 to the power 5886,239,331,993,033,479,900,000
First ten multiples61,590, 123,180, 184,770, 246,360, 307,950, 369,540, 431,130, 492,720, 554,310, 615,900
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 5Yes
Divisible by 6Yes
Divisible by 7No, remainder 4
Divisible by 8No, remainder 6
Divisible by 9No, remainder 3
Divisible by 10Yes
Divisible by 11No, remainder 1
Divisible by 12No, remainder 6
Divisible by 100No, remainder 90

Collatz (3n + 1) trajectory

Steps to reach 155the total stopping time
Highest value reached138,5802× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps61,590 → 30,795 → 92,386 → 46,193 → 138,580 → 69,290 → 34,645 → 103,936 → 51,968 → 25,984 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage6,159,000%
61,590% as a decimal615.9
61,590% of 10061,590
61,590% of 1,000615,900
As a fraction of 10061,590/100

Read another way

As bytes60.146 KiB
As a 24-bit colour#00F096

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