Recognised as Number

61,091

Positive
Odd
Prime
5 digits

61,091 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value61,091

Digit count5

Digit sum17

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times the digit product can be taken before one digit is left

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation61,091

Distinct prime factors161,091

Number of divisors2

Sum of divisors σ(n)61,092

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)61,090integers below n that share no factor with it

Carmichael function λ(n)61,090the 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, 61,0912 in total

Arithmetic

Previous number61,090

Next number61,092

Double122,182

Half30,545.5

Square3,732,110,281

Cube227,998,349,176,571

Square root247.165936164≈irrational, shown to 9 decimal places

Cube root39.384537036≈

Negation-61,091

Reciprocal0.000016369≈

Representations

Decimal61,091

Binary111011101010001116 bits

Octal167243

HexadecimalEEA3

Base 361B4Z

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordssixty-one thousand and ninety-one

Ordinalsixty-one thousand and ninety-first

Scientific notation6.1091 × 10^4

Engineering notation61.091 × 10^3

In other bases

Ternary10002210122base 3; the most digit-efficient integer base after e: 11 digits

Quinary3423331base 5; one hand: 7 digits

Septenary343052base 7: 6 digits

Nonary102718base 9; each digit is two ternary digits: 6 digits

Duodecimal2b42bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits

Vigesimal7cebbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal16:58:11base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

Balanced ternary10010T11T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary10011001111100111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1110111010100011

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 odd

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes2ee a3

Gray code1001100111110010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1110111010100011

32-bit00000000000000001110111010100011

64-bit0000000000000000000000000000000000000000000000001110111010100011

One's complement0001000101011100at 16 bits, every bit flipped

Bits reversed1100010101110111at 16 bits

Rotated left by 11101110101000111at 16 bits, wrapping

Shifted left by 111101110101000110= 122,182, no wrap

Shifted right by 1111011101010001= 30,545, discarding the low bit

These bits as a double3.01829644 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime61,099+8

Previous prime61,057−34

Distance to nearest prime0, it is prime

Nearest square below61,009

Nearest square above61,504

Powers & multiples

61,091 to the power 23,732,110,281

61,091 to the power 3227,998,349,176,571

61,091 to the power 413,928,647,149,545,898,961

61,091 to the power 5850,914,983,012,908,513,426,451

First ten multiples61,091, 122,182, 183,273, 244,364, 305,455, 366,546, 427,637, 488,728, 549,819, 610,910

Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 5

Divisible by 7No, remainder 2

Divisible by 8No, remainder 3

Divisible by 9No, remainder 8

Divisible by 10No, remainder 1

Divisible by 11No, remainder 8

Divisible by 12No, remainder 11

Divisible by 100No, remainder 91

Collatz (3n + 1) trajectory

Steps to reach 186the total stopping time

Highest value reached274,9124× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps61,091 → 183,274 → 91,637 → 274,912 → 137,456 → 68,728 → 34,364 → 17,182 → 8,591 → 25,774 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage6,109,100%

61,091% as a decimal610.91

61,091% of 10061,091

61,091% of 1,000610,910

As a fraction of 10061,091/100

Read another way

As seconds16 hours, 58 minutes and 11 seconds

As bytes59.659 KiB

As a 24-bit colour#00EEA3

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.