Recognised as Number

52,447

Positive
Odd
Composite
5 digits

52,447 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value52,447

Digit count5

Digit sum22

Digit product1,120

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation179 × 293

Distinct prime factors2179, 293

Number of divisors4

Sum of divisors σ(n)52,920

Aliquot sum473sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)25,988the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 51,976

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 179, 293, 52,4474 in total

Arithmetic

Previous number52,446

Next number52,448

Double104,894

Half26,223.5

Square2,750,687,809

Cube144,265,323,518,623

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

Cube root37.431757369≈

Negation-52,447

Reciprocal0.0000190669≈

Representations

Decimal52,447

Binary110011001101111116 bits

Octal146337

HexadecimalCCDF

Base 3614GV

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

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

Ordinalfifty-two thousand, four hundred and forty-seventh

Scientific notation5.2447 × 10^4

Engineering notation52.447 × 10^3

In other bases

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

Quinary3134242base 5; one hand: 7 digits

Septenary305623base 7: 6 digits

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

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

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

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

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

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

Bit-level

1100110011011111

Bit length16 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits5within that length

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

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes2cc df

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

At each machine width

16-bit1100110011011111

32-bit00000000000000001100110011011111

64-bit0000000000000000000000000000000000000000000000001100110011011111

One's complement0011001100100000at 16 bits, every bit flipped

Bits reversed1111101100110011at 16 bits

Rotated left by 11001100110111111at 16 bits, wrapping

Shifted left by 111001100110111110= 104,894, no wrap

Shifted right by 1110011001101111= 26,223, discarding the low bit

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

Nearest landmarks

Next prime52,453+6

Previous prime52,433−14

Distance to nearest prime6

Nearest square below52,441

Nearest square above52,900

Powers & multiples

52,447 to the power 22,750,687,809

52,447 to the power 3144,265,323,518,623

52,447 to the power 47,566,283,422,581,220,481

52,447 to the power 5396,828,866,664,117,270,567,007

First ten multiples52,447, 104,894, 157,341, 209,788, 262,235, 314,682, 367,129, 419,576, 472,023, 524,470

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 3

Divisible by 5No, remainder 2

Divisible by 6No, remainder 1

Divisible by 7No, remainder 3

Divisible by 8No, remainder 7

Divisible by 9No, remainder 4

Divisible by 10No, remainder 7

Divisible by 11No, remainder 10

Divisible by 12No, remainder 7

Divisible by 100No, remainder 47

Collatz (3n + 1) trajectory

Steps to reach 152the total stopping time

Highest value reached796,55215× the starting value

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

First steps52,447 → 157,342 → 78,671 → 236,014 → 118,007 → 354,022 → 177,011 → 531,034 → 265,517 → 796,552 → …

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

As a percentage & fraction

As a percentage5,244,700%

52,447% as a decimal524.47

52,447% of 10052,447

52,447% of 1,000524,470

As a fraction of 10052,447/100

Read another way

As seconds14 hours, 34 minutes and 7 seconds

As bytes51.218 KiB

As a 24-bit colour#00CCDF

Keep nerding

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