Recognised as Number

53,879

Positive
Odd
Composite
5 digits

53,879 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 5.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value53,879

Digit count5

Digit sum32

Digit product7,560

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

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation7 × 43 × 179

Distinct prime factors37, 43, 179

Number of divisors8

Sum of divisors σ(n)63,360

Aliquot sum9,481sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)3,738the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 44,856

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 7, 43, 179, 301, 1,253, 7,697, 53,8798 in total

Arithmetic

Previous number53,878

Next number53,880

Double107,758

Half26,939.5

Square2,902,946,641

Cube156,407,862,070,439

Square root232.118504217≈irrational, shown to 9 decimal places

Cube root37.76937882≈

Negation-53,879

Reciprocal0.0000185601≈

Representations

Decimal53,879

Binary110100100111011116 bits

Octal151167

HexadecimalD277

Base 3615KN

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

In wordsfifty-three thousand, eight hundred and seventy-nine

Ordinalfifty-three thousand, eight hundred and seventy-ninth

Scientific notation5.3879 × 10^4

Engineering notation53.879 × 10^3

In other bases

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

Quinary3211004base 5; one hand: 7 digits

Septenary313040base 7: 6 digits

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

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

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

Sexagesimal14:57:59base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

1101001001110111

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

Bytes2d2 77

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

At each machine width

16-bit1101001001110111

32-bit00000000000000001101001001110111

64-bit0000000000000000000000000000000000000000000000001101001001110111

One's complement0010110110001000at 16 bits, every bit flipped

Bits reversed1110111001001011at 16 bits

Rotated left by 11010010011101111at 16 bits, wrapping

Shifted left by 111010010011101110= 107,758, no wrap

Shifted right by 1110100100111011= 26,939, discarding the low bit

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

Nearest landmarks

Next prime53,881+2

Previous prime53,861−18

Distance to nearest prime2

Nearest square below53,824

Nearest square above54,289

Powers & multiples

53,879 to the power 22,902,946,641

53,879 to the power 3156,407,862,070,439

53,879 to the power 48,427,099,200,493,182,881

53,879 to the power 5454,043,677,823,372,200,445,399

First ten multiples53,879, 107,758, 161,637, 215,516, 269,395, 323,274, 377,153, 431,032, 484,911, 538,790

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 4

Divisible by 6No, remainder 5

Divisible by 7Yes

Divisible by 8No, remainder 7

Divisible by 9No, remainder 5

Divisible by 10No, remainder 9

Divisible by 11No, remainder 1

Divisible by 12No, remainder 11

Divisible by 100No, remainder 79

Collatz (3n + 1) trajectory

Steps to reach 191the total stopping time

Highest value reached363,6886× the starting value

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

First steps53,879 → 161,638 → 80,819 → 242,458 → 121,229 → 363,688 → 181,844 → 90,922 → 45,461 → 136,384 → …

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

As a percentage & fraction

As a percentage5,387,900%

53,879% as a decimal538.79

53,879% of 10053,879

53,879% of 1,000538,790

As a fraction of 10053,879/100

Read another way

As seconds14 hours, 57 minutes and 59 seconds

As bytes52.616 KiB

As a 24-bit colour#00D277

Keep nerding

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