Recognised as Number

52,764

Positive
Even
Composite
5 digits

52,764 is an even 5-digit integer and a composite number. It has 12 divisors and a digital root of 6.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value52,764

Digit count5

Digit sum24

Digit product1,680

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 3 × 4,397

Distinct prime factors32, 3, 4,397

Number of divisors12

Sum of divisors σ(n)123,144

Aliquot sum70,380sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

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

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 3, 4, 6, 12, 4,397, 8,794, 13,191, 17,588, 26,382, 52,76412 in total

Arithmetic

Previous number52,763

Next number52,765

Double105,528

Half26,382

Square2,784,039,696

Cube146,897,070,519,744

Square root229.704157559≈irrational, shown to 9 decimal places

Cube root37.507020908≈

Negation-52,764

Reciprocal0.0000189523≈

Representations

Decimal52,764

Binary110011100001110016 bits

Octal147034

HexadecimalCE1C

Base 3614PO

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

In wordsfifty-two thousand, seven hundred and sixty-four

Ordinalfifty-two thousand, seven hundred and sixty-fourth

Scientific notation5.2764 × 10^4

Engineering notation52.764 × 10^3

In other bases

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

Quinary3142024base 5; one hand: 7 digits

Septenary306555base 7: 6 digits

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

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

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

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

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

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

Bit-level

1100111000011100

Bit length16 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits8within that length

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

Highest set bitbit 15worth 32,768

Lowest set bitbit 22 trailing zeros

Power of twoNo

Bytes2ce 1c

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

At each machine width

16-bit1100111000011100

32-bit00000000000000001100111000011100

64-bit0000000000000000000000000000000000000000000000001100111000011100

One's complement0011000111100011at 16 bits, every bit flipped

Bits reversed0011100001110011at 16 bits

Rotated left by 11001110000111001at 16 bits, wrapping

Shifted left by 111001110000111000= 105,528, no wrap

Shifted right by 1110011100001110= 26,382, discarding the low bit

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

Nearest landmarks

Next prime52,769+5

Previous prime52,757−7

Distance to nearest prime5

Nearest square below52,441

Nearest square above52,900

Powers & multiples

52,764 to the power 22,784,039,696

52,764 to the power 3146,897,070,519,744

52,764 to the power 47,750,877,028,903,772,416

52,764 to the power 5408,967,275,553,078,647,757,824

First ten multiples52,764, 105,528, 158,292, 211,056, 263,820, 316,584, 369,348, 422,112, 474,876, 527,640

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 4

Divisible by 6Yes

Divisible by 7No, remainder 5

Divisible by 8No, remainder 4

Divisible by 9No, remainder 6

Divisible by 10No, remainder 4

Divisible by 11No, remainder 8

Divisible by 12Yes

Divisible by 100No, remainder 64

Collatz (3n + 1) trajectory

Steps to reach 1127the total stopping time

Highest value reached89,0441× the starting value

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

First steps52,764 → 26,382 → 13,191 → 39,574 → 19,787 → 59,362 → 29,681 → 89,044 → 44,522 → 22,261 → …

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

As a percentage & fraction

As a percentage5,276,400%

52,764% as a decimal527.64

52,764% of 10052,764

52,764% of 1,000527,640

As a fraction of 10052,764/100

Read another way

As seconds14 hours, 39 minutes and 24 seconds

As bytes51.527 KiB

As a 24-bit colour#00CE1C

Keep nerding

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