Recognised as Number

52,449

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value52,449

Digit count5

Digit sum24

Digit product1,440

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 17,483

Distinct prime factors23, 17,483

Number of divisors4

Sum of divisors σ(n)69,936

Aliquot sum17,487sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 17,483, 52,4494 in total

Arithmetic

Previous number52,448

Next number52,450

Double104,898

Half26,224.5

Square2,750,897,601

Cube144,281,828,274,849

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

Cube root37.432233167≈

Negation-52,449

Reciprocal0.0000190661≈

Representations

Decimal52,449

Binary110011001110000116 bits

Octal146341

HexadecimalCCE1

Base 3614GX

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

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

Ordinalfifty-two thousand, four hundred and forty-ninth

Scientific notation5.2449 × 10^4

Engineering notation52.449 × 10^3

In other bases

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

Quinary3134244base 5; one hand: 7 digits

Septenary305625base 7: 6 digits

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

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

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

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

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

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

Bit-level

1100110011100001

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 odd

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes2cc e1

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

At each machine width

16-bit1100110011100001

32-bit00000000000000001100110011100001

64-bit0000000000000000000000000000000000000000000000001100110011100001

One's complement0011001100011110at 16 bits, every bit flipped

Bits reversed1000011100110011at 16 bits

Rotated left by 11001100111000011at 16 bits, wrapping

Shifted left by 111001100111000010= 104,898, no wrap

Shifted right by 1110011001110000= 26,224, discarding the low bit

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

Nearest landmarks

Next prime52,453+4

Previous prime52,433−16

Distance to nearest prime4

Nearest square below52,441

Nearest square above52,900

Powers & multiples

52,449 to the power 22,750,897,601

52,449 to the power 3144,281,828,274,849

52,449 to the power 47,567,437,611,187,555,201

52,449 to the power 5396,904,535,269,176,082,737,249

First ten multiples52,449, 104,898, 157,347, 209,796, 262,245, 314,694, 367,143, 419,592, 472,041, 524,490

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 1

Divisible by 5No, remainder 4

Divisible by 6No, remainder 3

Divisible by 7No, remainder 5

Divisible by 8No, remainder 1

Divisible by 9No, remainder 6

Divisible by 10No, remainder 9

Divisible by 11No, remainder 1

Divisible by 12No, remainder 9

Divisible by 100No, remainder 49

Collatz (3n + 1) trajectory

Steps to reach 1127the total stopping time

Highest value reached672,13612× the starting value

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

First steps52,449 → 157,348 → 78,674 → 39,337 → 118,012 → 59,006 → 29,503 → 88,510 → 44,255 → 132,766 → …

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

As a percentage & fraction

As a percentage5,244,900%

52,449% as a decimal524.49

52,449% of 10052,449

52,449% of 1,000524,490

As a fraction of 10052,449/100

Read another way

As seconds14 hours, 34 minutes and 9 seconds

As bytes51.22 KiB

As a 24-bit colour#00CCE1

Keep nerding

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