Recognised as Number

51,768

Positive
Even
Composite
5 digits

51,768 is an even 5-digit integer and a composite number. It has 24 divisors and a digital root of 9.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value51,768

Digit count5

Digit sum27

Digit product1,680

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 factorisation2^3 × 3^2 × 719

Distinct prime factors32, 3, 719

Number of divisors24

Sum of divisors σ(n)140,400

Aliquot sum88,632sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)2,154the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 17,232

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 36, 72, 719, 1,438, 2,157, 2,876, 4,314, 5,752, 6,471, 8,628, 12,942, 17,256, 25,884, 51,76824 in total

Arithmetic

Previous number51,767

Next number51,769

Double103,536

Half25,884

Square2,679,925,824

Cube138,734,400,056,832

Square root227.52582271≈irrational, shown to 9 decimal places

Cube root37.269519671≈

Negation-51,768

Reciprocal0.000019317≈

Representations

Decimal51,768

Binary110010100011100016 bits

Octal145070

HexadecimalCA38

Base 3613Y0

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

In wordsfifty-one thousand, seven hundred and sixty-eight

Ordinalfifty-one thousand, seven hundred and sixty-eighth

Scientific notation5.1768 × 10^4

Engineering notation51.768 × 10^3

In other bases

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

Quinary3124033base 5; one hand: 7 digits

Septenary303633base 7: 6 digits

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

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

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

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

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

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

Bit-level

1100101000111000

Bit length16 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits9within that length

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

Highest set bitbit 15worth 32,768

Lowest set bitbit 33 trailing zeros

Power of twoNo

Bytes2ca 38

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

At each machine width

16-bit1100101000111000

32-bit00000000000000001100101000111000

64-bit0000000000000000000000000000000000000000000000001100101000111000

One's complement0011010111000111at 16 bits, every bit flipped

Bits reversed0001110001010011at 16 bits

Rotated left by 11001010001110001at 16 bits, wrapping

Shifted left by 111001010001110000= 103,536, no wrap

Shifted right by 1110010100011100= 25,884, discarding the low bit

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

Nearest landmarks

Next prime51,769+1

Previous prime51,767−1

Distance to nearest prime1

Nearest square below51,529

Nearest square above51,984

Powers & multiples

51,768 to the power 22,679,925,824

51,768 to the power 3138,734,400,056,832

51,768 to the power 47,182,002,422,142,078,976

51,768 to the power 5371,797,901,389,451,144,429,568

First ten multiples51,768, 103,536, 155,304, 207,072, 258,840, 310,608, 362,376, 414,144, 465,912, 517,680

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 3

Divisible by 6Yes

Divisible by 7No, remainder 3

Divisible by 8Yes

Divisible by 9Yes

Divisible by 10No, remainder 8

Divisible by 11No, remainder 2

Divisible by 12Yes

Divisible by 100No, remainder 68

Collatz (3n + 1) trajectory

Steps to reach 1171the total stopping time

Highest value reached6,810,136131× the starting value

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

First steps51,768 → 25,884 → 12,942 → 6,471 → 19,414 → 9,707 → 29,122 → 14,561 → 43,684 → 21,842 → …

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

As a percentage & fraction

As a percentage5,176,800%

51,768% as a decimal517.68

51,768% of 10051,768

51,768% of 1,000517,680

As a fraction of 10051,768/100

Read another way

As seconds14 hours, 22 minutes and 48 seconds

As bytes50.555 KiB

As a 24-bit colour#00CA38

Keep nerding

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