Recognised as Number

61,092

Positive
Even
Composite
5 digits

61,092 is an even 5-digit integer and a composite number. It has 18 divisors and a digital root of 9.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value61,092

Digit count5

Digit sum18

Digit product0zero, because one of the digits is zero

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

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 3^2 × 1,697

Distinct prime factors32, 3, 1,697

Number of divisors18

Sum of divisors σ(n)154,518

Aliquot sum93,426sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)5,088the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 20,352

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 2, 3, 4, 6, 9, 12, 18, 36, 1,697, 3,394, 5,091, 6,788, 10,182, 15,273, 20,364, 30,546, 61,09218 in total

Arithmetic

Previous number61,091

Next number61,093

Double122,184

Half30,546

Square3,732,232,464

Cube228,009,545,690,688

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

Cube root39.384751931≈

Negation-61,092

Reciprocal0.0000163688≈

Representations

Decimal61,092

Binary111011101010010016 bits

Octal167244

HexadecimalEEA4

Base 361B50

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

In wordssixty-one thousand and ninety-two

Ordinalsixty-one thousand and ninety-second

Scientific notation6.1092 × 10^4

Engineering notation61.092 × 10^3

In other bases

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

Quinary3423332base 5; one hand: 7 digits

Septenary343053base 7: 6 digits

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

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

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

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

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

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

Bit-level

1110111010100100

Bit length16 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits7within that length

Bit parityodd9 set bits, so odd; not the same as the number itself being even

Highest set bitbit 15worth 32,768

Lowest set bitbit 22 trailing zeros

Power of twoNo

Bytes2ee a4

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

At each machine width

16-bit1110111010100100

32-bit00000000000000001110111010100100

64-bit0000000000000000000000000000000000000000000000001110111010100100

One's complement0001000101011011at 16 bits, every bit flipped

Bits reversed0010010101110111at 16 bits

Rotated left by 11101110101001001at 16 bits, wrapping

Shifted left by 111101110101001000= 122,184, no wrap

Shifted right by 1111011101010010= 30,546, discarding the low bit

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

Nearest landmarks

Next prime61,099+7

Previous prime61,091−1

Distance to nearest prime1

Nearest square below61,009

Nearest square above61,504

Powers & multiples

61,092 to the power 23,732,232,464

61,092 to the power 3228,009,545,690,688

61,092 to the power 413,929,559,165,335,511,296

61,092 to the power 5850,984,628,528,677,056,095,232

First ten multiples61,092, 122,184, 183,276, 244,368, 305,460, 366,552, 427,644, 488,736, 549,828, 610,920

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

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4Yes

Divisible by 5No, remainder 2

Divisible by 6Yes

Divisible by 7No, remainder 3

Divisible by 8No, remainder 4

Divisible by 9Yes

Divisible by 10No, remainder 2

Divisible by 11No, remainder 9

Divisible by 12Yes

Divisible by 100No, remainder 92

Collatz (3n + 1) trajectory

Steps to reach 1148the total stopping time

Highest value reached260,9804× the starting value

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

First steps61,092 → 30,546 → 15,273 → 45,820 → 22,910 → 11,455 → 34,366 → 17,183 → 51,550 → 25,775 → …

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

As a percentage & fraction

As a percentage6,109,200%

61,092% as a decimal610.92

61,092% of 10061,092

61,092% of 1,000610,920

As a fraction of 10061,092/100

Read another way

As seconds16 hours, 58 minutes and 12 seconds

As bytes59.66 KiB

As a 24-bit colour#00EEA4

Keep nerding

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