Recognised as Number

54,927

Positive
Odd
Composite
5 digits

54,927 is an odd 5-digit integer and a composite number. It has 12 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value54,927

Digit count5

Digit sum27

Digit product2,520

Multiplicative persistence2times 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 numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 17 × 359

Distinct prime factors33, 17, 359

Number of divisors12

Sum of divisors σ(n)84,240

Aliquot sum29,313sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)8,592the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 34,368

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

SquarefreeNohas a repeated prime factor

All divisors1, 3, 9, 17, 51, 153, 359, 1,077, 3,231, 6,103, 18,309, 54,92712 in total

Arithmetic

Previous number54,926

Next number54,928

Double109,854

Half27,463.5

Square3,016,975,329

Cube165,713,403,895,983

Square root234.365099791≈irrational, shown to 9 decimal places

Cube root38.012691975≈

Negation-54,927

Reciprocal0.000018206≈

Representations

Decimal54,927

Binary110101101000111116 bits

Octal153217

HexadecimalD68F

Base 3616DR

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

In wordsfifty-four thousand, nine hundred and twenty-seven

Ordinalfifty-four thousand, nine hundred and twenty-seventh

Scientific notation5.4927 × 10^4

Engineering notation54.927 × 10^3

In other bases

Ternary2210100100base 3; the most digit-efficient integer base after e: 10 digits

Quinary3224202base 5; one hand: 7 digits

Septenary316065base 7: 6 digits

Nonary83310base 9; each digit is two ternary digits: 5 digits

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

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

Sexagesimal15:15:27base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

1101011010001111

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

Bytes2d6 8f

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

At each machine width

16-bit1101011010001111

32-bit00000000000000001101011010001111

64-bit0000000000000000000000000000000000000000000000001101011010001111

One's complement0010100101110000at 16 bits, every bit flipped

Bits reversed1111000101101011at 16 bits

Rotated left by 11010110100011111at 16 bits, wrapping

Shifted left by 111010110100011110= 109,854, no wrap

Shifted right by 1110101101000111= 27,463, discarding the low bit

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

Nearest landmarks

Next prime54,941+14

Previous prime54,919−8

Distance to nearest prime8

Nearest square below54,756

Nearest square above55,225

Powers & multiples

54,927 to the power 23,016,975,329

54,927 to the power 3165,713,403,895,983

54,927 to the power 49,102,140,135,794,658,241

54,927 to the power 5499,953,251,238,793,193,203,407

First ten multiples54,927, 109,854, 164,781, 219,708, 274,635, 329,562, 384,489, 439,416, 494,343, 549,270

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 3

Divisible by 5No, remainder 2

Divisible by 6No, remainder 3

Divisible by 7No, remainder 5

Divisible by 8No, remainder 7

Divisible by 9Yes

Divisible by 10No, remainder 7

Divisible by 11No, remainder 4

Divisible by 12No, remainder 3

Divisible by 100No, remainder 27

Collatz (3n + 1) trajectory

Steps to reach 1153the total stopping time

Highest value reached556,14410× the starting value

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

First steps54,927 → 164,782 → 82,391 → 247,174 → 123,587 → 370,762 → 185,381 → 556,144 → 278,072 → 139,036 → …

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

As a percentage & fraction

As a percentage5,492,700%

54,927% as a decimal549.27

54,927% of 10054,927

54,927% of 1,000549,270

As a fraction of 10054,927/100

Read another way

As seconds15 hours, 15 minutes and 27 seconds

As bytes53.64 KiB

As a 24-bit colour#00D68F

Keep nerding

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